Topic
Fair-share scheduling
About: Fair-share scheduling is a research topic. Over the lifetime, 24724 publications have been published within this topic receiving 516648 citations.
Papers published on a yearly basis
Papers
More filters
01 Feb 2006
TL;DR: This work considers the problem of designing a dynamic scheduling strategy that takes into account both workload and memory information in the context of the parallel multifrontal factorization and shows that a new scheduling algorithm significantly improves both the memory behaviour and the factorization time.
Abstract: We consider the problem of designing a dynamic scheduling strategy that takes into account both workload and memory information in the context of the parallel multifrontal factorization. The originality of our approach is that we base our estimations (work and memory) on a static optimistic scenario during the analysis phase. This scenario is then used during the factorization phase to constrain the dynamic decisions that compute fully irregular partitions in order to better balance the workload. We show that our new scheduling algorithm significantly improves both the memory behaviour and the factorization time. We give experimental results for large challenging real-life 3D problems on 64 and 128 processors.
1,072 citations
Journal Article•
1,046 citations
TL;DR: In this paper, the complexity of a class of vehicle routing and scheduling problems is investigated, and the results on the worst-case performance of approximation algorithms are discussed and some directions for future research are suggested.
Abstract: The complexity of a class of vehicle routing and scheduling problems is investigated. We review known NP-hardness results and compile the results on the worst-case performance of approximation algorithms. Some directions for future research are suggested. The presentation is based on two discussion sessions during the Workshop to Investigate Future Directions in Routing and Scheduling of Vehicles and Crews, held at the University of Maryland at College Park, June 4–6, 1979.
1,017 citations
DOI•
01 Mar 1998TL;DR: A user-controllable, general-purpose, pseudorandom task graph generator called Task Graphs For Free, which has the ability to generate independent tasks as well as task sets which are composed of partially ordered task graphs.
Abstract: We present a user-controllable, general-purpose, pseudorandom task graph generator called Task Graphs For Free (TGFF). TGFF creates problem instances for use in allocation and scheduling research. It has the ability to generate independent tasks as well as task sets which are composed of partially ordered task graphs. A complete description of a scheduling problem instance is created, including attributes for processors, communication resources, tasks, and inter-task communication. The user may parametrically control the correlations between attributes. Sharing TGFF's parameter settings allows researchers to easily reproduce the examples used by others, regardless of the platform on which TGFF is run.
962 citations