The Case For Prediction-based Best-effort Real-time Systems 

Peter A. Dinda, Bruce Lowekamp, 
Loukas F. Kallivokas, and David R. O'Hallaron,


Abstract: We propose a prediction-based best-effort real-time service
to support distributed, interactive applications in shared, unreserved
computing environments.  These applications have timing requirements,
but can continue to function when deadlines are missed.  In addition,
they expose two kinds of adaptability: tasks can be run on any host,
and their resource demands can be adjusted based on user-perceived
quality.  After defining this class of applications, we describe a
significant example, an earthquake visualization tool, and show how it
could benefit from the service.  Finally, we present evidence that the
service is feasible in the form of two studies of algorithms for host
load prediction and for predictive task mapping.



@incollection(wpdrts99,
author	=	"P. Dinda and B. Lowekamp and 
		  L. Kallivokas and D. O'Hallaron" ,
title	=	"The Case for Prediction-Based Best-Effort Real-Time Systems" ,
pages	=	"309--318" ,
booktitle=	"Proc. of the 7th International Workshop on Parallel and
		  Distributed Real-Time Systems (WPDRTS 1999)" ,
series	=	"Lecture Notes in Computer Science",
volume	=	1586,
month	=	may,
year	=	1999,
address	=	"San Juan, PR" ,
publisher=	"Springer-Verlag",
)