This paper addresses the scheduling of systems that implement the abort and restart (AR) model. The AR model requires that pre- empted tasks are aborted. As a result high priority tasks run quickly and shared resources need not be protected (as tasks only work on copies of these resources). However there is signicant wastage as low priority tasks may be subject to a series of aborts. We show that ex- act analysis of the AR model is intractable. A sucient but tractable test is developed and is used to address the priority assignment issue. Again an optimal tractable algorithm is not available. The paper de- velops a priority assignment heuristic than is demonstrated to perform better than existing schemes.

BibTex Entry

@techreport{Wong2013,
 author = {H.C. Wong and A. Burns},
 institution = {University of York, Department of Computer Science},
 number = {YCS-2013-481},
 title = {Improved Priority Assignment for the Abort-and-Restart (AR) Model},
 year = {2013}
}