RTAS 2005 START ConferenceManager    


Multiprocessor Resource Allocation for Hard-real-time Streaming with a Dynamic job-mix

Orlando Moreira, Jan David Mol, Marco Bekooij, Jef van Meerbergen

Presented at IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2005), San Francisco, California, March 7 - 10, 2005


Abstract

An embedded multiprocessor which can run multiple hard-real-time (HRT) jobs si­multaneously has to guarantee enough resources are available such that timing constraints are met. It is essential that both application model and hardware are tailored to this goal. Moreover, suitable resource allocation and scheduling are needed. This paper proposes a resource allocator which gives guarantees for HRT streaming applications. Because new jobs arrive during operation, resource allocation is performed at run-time. This provides admission control. Resource budget enforcement is handled by local schedulers. We formalize our re­source allocation problem and we show it is NP-com­plete. We developed heuristics to approximate its so­lution during run-time and evaluated them. A modified First-fit Vector Bin-Packing al­gorithm is a good solution; it can allocate 95% of the computational resources, while handling a large number of job arrivals and departures on a heavily loaded sys­tem.


  
START Conference Manager (V2.47.7)
Maintainer: hjkim@redwood.snu.ac.kr