Scheduling contract algorithms on multiple processors

Authors:
Daniel S. Bernstein;Theodore J. Perkins;Shlomo Zilberstein;Lev Finkelstein
Affiliations:
Department of Computer Science, University of Massachusetts, Amherst, MA;Department of Computer Science, University of Massachusetts, Amherst, MA;Department of Computer Science, University of Massachusetts, Amherst, MA;Computer Science Department, Technion--Israel Institute of Technology, Haifa 32000, Israel
Venue:
Eighteenth national conference on Artificial intelligence
Year:
2002

Citing 5
Cited 6

Amortized efficiency of list update and paging rules

Communications of the ACM
Do the right thing: studies in limited rationality

Do the right thing: studies in limited rationality
Searching in the plane

Information and Computation
Real-Time Problem-Solving with Contract Algorithms

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Variable Resolution Discretization for High-Accuracy Solutions of Optimal Control Problems

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence

Classifying under computational resource constraints: anytime classification using probabilistic estimators

Machine Learning
Classifying under computational resource constraints: anytime classification using probabilistic estimators

Machine Learning
Optimal scheduling of contract algorithms for anytime problems

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Optimal scheduling of contract algorithms with soft deadlines

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Contract algorithms and robots on rays: unifying two scheduling problems

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Interruptible algorithms for multi-problem solving

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Anytime algorithms offer a tradeoff between computation time and the quality of the result returned. They can be divided into two classes: contract algorithms, for which the total run time must be specified in advance, and interruptible algorithms, which can be queried at any time for a solution. An interruptible algorithm can be constructed from a contract algorithm by repeatedly activating the contract algorithm with increasing run times. The acceleration ratio of a run-time schedule is a worst-case measure of how inefficient the constructed interruptible algorithm is compared to the contract algorithm. The smallest acceleration ratio achievable on a single processor is known. Using multiple processors, smaller acceleration ratios are possible. In this paper, we provide a schedule for m processors and prove that it is optimal for all m. Our results provide general guidelines for the use of parallel processors in the design of real-time systems.