Results 1 to 10 of about 535,286 (269)
An adaptive self‐scheduling loop scheduler
Concurrency and Computation: Practice and Experience, 2021 AbstractMany shared‐memory parallel irregular applications, such as sparse linear algebra and graph algorithms, depend on efficient loop scheduling (LS) in a fork‐join manner despite that the work per loop iteration can greatly vary depending on the application and the input. Because of the importance of LS, many different methods (e.g., workload‐aware
Joshua Dennis Booth, Phillip Allen Lane
openaire +2 more sources
Scheduling the scheduling task: a time-management perspective on scheduling [PDF]
Cognition, Technology & Work, 2017 L'objectif de cette étude était de caractériser la façon dont les planificateurs passent leur temps à interagir avec des parties externes. Le temps est la ressource la plus critique à la disposition des planificateurs ; cependant, son utilisation a été négligée par des études empiriques antérieures.
José Antonio Larco Martinelli +2 more
openaire +5 more sources
Bulk Scheduling With the DIANA Scheduler [PDF]
IEEE Transactions on Nuclear Science, 2006 12 pages, 11 figures.
Ashiq Anjum +3 more
openaire +2 more sources
The Geometry of Scheduling [PDF]
SIAM Journal on Computing, 2010 Conference version in FOCS ...
Bansal, N., Pruhs, K.R.
openaire +3 more sources
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
Journal of Algorithms, 1998 Summary: On-line machine scheduling has been studied extensively, but the fundamental issue of fairness in scheduling is still mostly open. In this paper, we explore the issue in settings where there are long-lived processes which should be repeatedly scheduled for various tasks throughout the lifetime of a system.
Miklós Ajtai +5 more
openaire +3 more sources
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
, 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
Journal of Combinatorial Theory, Series A, 2016 Final version, substantially shortened, 18 ...
Felix Breuer, Caroline J. Klivans
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