Results 21 to 30 of about 157,519 (269)
Meta-Heuristic Algorithms for the Generalized Extensible Bin Packing Problem With Overload Cost
IEEE Access, 2022 In this paper, we consider a generalized extensible bin packing problem with overload cost, first proposed by Denton et al. in 2010, in which the total size of items packed into a bin is allowed to exceed its capacity, and the cost incurred each bin is ...
Ran Ding, Bin Deng, Weidong Li
doaj +1 more source
Increasing Speed Scheduling and Flow Scheduling [PDF]
, 2010 Network flows and scheduling have been studied intensely, but separately. In many applications a joint optimization model for routing and scheduling is desireable. Therefore, we study flows over time with a demand split into jobs. The objective is to minimize the weighted sum of completion times of these jobs.
Sebastian Stiller, Andreas Wiese
openaire +1 more source
To schedule or not to schedule: When no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks [PDF]
Computer Networks, 2020 Conventional wisdom for minimizing the average flow completion time (AFCT) in the datacenter network (DCN), where flow sizes are highly variable, would suggest scheduling every individual flow. However, we show that considering scheduling delay (including scheduler's computational and communication delays), serving most of the flows without any ...
Soheil Abbasloo +2 more
openaire +2 more sources
, 2021 Interactions amongst different processes in concurrent software are governed by a protocol. The blocking I/O operations involved in a protocol may temporarily suspend the execution of some processes in an application. Scheduling consists of the allocation of available processors to the appropriate non-suspended processes in an application, such that ...
K.P.C. Dokter (Kasper) +1 more
openaire +2 more sources
List schedules for cyclic scheduling
Discrete Applied Mathematics, 1999 This paper adresses the definition and properties of list scheduling in the context of scheduling a cyclic set of n non-preemptive and non-reentrant-dependent tasks on m identical processors when the reduced precedence graph is assumed to be strongly connected.
openaire +1 more source
Intuitionistic Fuzzy Similarity Measures and Their Role in Classification
Journal of Intelligent Systems, 2016 We present some similarity and distance measures between intuitionistic fuzzy sets (IFSs). Thus, we propose two semi-metric distance measures between IFSs.
Baccour Leila +2 more
doaj +1 more source
Recent Developments in Mobile Cloud Scheduling: State-of-the-Art, Challenges and Perspectives
Journal of Telecommunications and Information Technology, 2013 Cloud computing became recently one of the most popular multi-layer distributed computational and data processing environments with various types of services, distributed data storages and resources.
Katarzyna Smelcerz
doaj +1 more source
Towards LoRaWAN without Data Loss: Studying the Performance of Different Channel Access Approaches
Sensors, 2022 The Long Range Wide Area Network (LoRaWAN) is one of the fastest growing Internet of Things (IoT) access protocols. It operates in the license free 868 MHz band and gives everyone the possibility to create their own small sensor networks. The drawback of
Frank Loh, Noah Mehling, Tobias Hoßfeld
doaj +1 more source
Mathematics, 2022 Industrial production facilities have been facing the requirement to optimise resource efficiency, while considering sustainable goals. This paper addresses the introduction of renewable energies in production by exploring the combined design and ...
Pedro Simão +3 more
doaj +1 more source
Analysis of 5G Channel Access for Collaboration with TSN Concluding at a 5G Scheduling Mechanism
Network, 2022 As 5G enters the application field of industrial communications, compatibility with technologies of wired deterministic communications such as Time-Sensitive Networking (TSN) needs to be considered during the standardization process.
Dennis Krummacker +3 more
doaj +1 more source