Results 261 to 270 of about 89,645 (310)
Some of the next articles are maybe not open access.
Robust Algorithms for Preemptive Scheduling
Algorithmica, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leah Epstein, Asaf Levin
openaire +1 more source
Algorithms for Scheduling Imprecise Computations
Computer, 1991Consideration is given to the problem of scheduling tasks each of which is logically decomposed into a mandatory subtask and an optional subtask. The mandatory subtask must be executed to completion. If the available processor time is insufficient, the optional subtask can be left incomplete. The error in the result of a task is equal to the processing
Jane W.-S. Liu +5 more
openaire +1 more source
Algorithm Selection and Scheduling
2011Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifying the most appropriate solver given an input instance, they are bound to make wrong and, at times, costly decisions.
Serdar Kadioglu +4 more
openaire +1 more source
On the Optimality of Feautrier’s Scheduling Algorithm
Concurrency and Computation: Practice and Experience, 2002AbstractFeautrier's scheduling algorithm is the most powerful existing algorithm for parallelism detection and extraction, but it has always been known to be suboptimal. However, the question as to whether it may miss some parallelism because of its design has not been answered. We show that this is not the case.
openaire +3 more sources
A Level Algorithm for Preemptive Scheduling
Journal of the ACM, 1977Muntz and Coffman give a level algorithm that constructs optimal preemptive schedules on identical processors when the task system is a tree or when there are only two processors available. Their algorithm is adapted here to handle processors of different speeds.
Edward C. Horvath, Shui Lam, Ravi Sethi
openaire +2 more sources
Stability and distributed scheduling algorithms
Proceedings of the 1985 ACM thirteenth annual conference on Computer Science - CSC '85, 1985Many distributed scheduling algorithms have been developed and reported in the current literature. However, very few of them explicitly treat stability issues. This paper first discusses stability issues for distributed scheduling algorithms in general terms.
openaire +1 more source
GEM: A geometric algorithm for scheduling
1993 IEEE International Symposium on Circuits and Systems, 2002Scheduling in high-level synthesis is essentially assigning operations to different clock cycles or Csteps. A simple algorithm for scheduling in high-level synthesis is presented. The critical path (longest path) approach is used, schedules better than or comparable to the existing algorithms are obtained.
Salil Raje, Majid Sarrafzadeh
openaire +1 more source
Performance Guarantees for Scheduling Algorithms
Operations Research, 1978One approach to coping with the apparent difficulty of many schedule-optimization problems, such as occur in machine shops and computer processing, is to devise efficient algorithms that find schedules guaranteed to be “near-optimal.” This paper presents an introduction to this approach by describing its application to a well-known multiprocessor ...
M. R. Garey +2 more
openaire +2 more sources
Design of Scheduling Algorithms: Applications
2010This chapter discusses the insights developed for designing scheduling algorithms according to three design projects where algorithms have been developed. The choice of applications covers a broad spectrum. The methods used are from three different fields, namely combinatorial optimization, genetic (evolutionary) algorithms, and mathematical ...
Jan, Riezebos +5 more
openaire +3 more sources
Algorithms for Scheduling Independent Tasks
Journal of the ACM, 1976The following job sequencing problems are studied: (i) single processor job sequencing with deadlines, (ii) job sequencing on m -identical processors to minimize finish time and related problems, (iii) job sequencing on 2-identical processors to minimize weighted mean flow time.
openaire +1 more source