Better late than never

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Better late than never

Full text

Pdf (993 KB)

Source

ACM Annual Computer Science Conference archive
Proceedings of the 1993 ACM conference on Computer science table of contents

Indianapolis, Indiana, United States

Pages: 44 - 51

Year of Publication: 1993

ISBN:0-89791-558-5

Authors

Hossein Moiin	Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
P. M. Melliar-Smith	Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
Louise Moser	Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 4, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/170791.170800 What is a DOI?

ABSTRACT

This paper investigates the trade-off between timeliness and precision of real-time tasks. For a task that must satisfy real-time requirements and that is capable of generating intermediate results of lower precision, an overall value function is defined as the product of its timeliness and precision. The problem of finding an optimal schedule for a set of tasks with such overall value functions is decomposed into two related subproblems of ordering and optimization. Optimal and heuristic solutions for each subproblem as well as the overall scheduling problem are presented.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Robert Abbott , Hector Garcia-Molina, Scheduling real-time transactions, ACM SIGMOD Record, v.17 n.1, p.71-81, March, 1988 [doi>10.1145/44203.44209]
	2	M. L. Dertouzos , A. K. Mok, Multiprocessor Online Scheduling of Hard-Real-Time Tasks, IEEE Transactions on Software Engineering, v.15 n.12, p.1497-1506, December 1989 [doi>10.1109/32.58762]
	3	A L Leistman , R H Campbell, A fault-tolerant scheduling problem, IEEE Transactions on Software Engineering, v.12 n.11, p.1088-1089, NOV. 1986
	4	Lit, K.J., Natxrajan, S. amd Liu, J.W.S., qmprechte Results: Utilizing Partial Computations in Real-Tune Systems," Proceedingm oi the IEEE Red-6me Sl~temJ Sltmpo#ium (December 1987), pp. 210-217.
	5	C. L. Liu , James W. Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM (JACM), v.20 n.1, p.46-61, Jan. 1973 [doi>10.1145/321738.321743]
	6	Carey Douglass Locke, Best-effort decision-making for real-time scheduling, 1986
	7	Hossein Moiin, Real-time scheduling algorithms, University of California at Santa Barbara, Santa Barbara, CA, 1992
	8	Wei-Kuan Shih , Jane W. S. Liu , Jen-Yao Chung, Algorithms for scheduling imprecise computations with timing constraints, SIAM Journal on Computing, v.20 n.3, p.537-552, June 1991 [doi>10.1137/0220035]