Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Noname manuscript No. (will be inserted by the editor)
 

Summary: Noname manuscript No.
(will be inserted by the editor)
Multiprocessor Extensions to Real-Time Calculus
Hennadiy Leontyev Samarjit Chakraborty
James H. Anderson
the date of receipt and acceptance should be inserted later
Abstract Many embedded platforms consist of a heterogeneous collection of pro-
cessing elements, memory modules, and communication subsystems. These compo-
nents often implement different scheduling/arbitration policies, have different inter-
faces, and are supplied by different vendors. Hence, compositional techniques for
modeling and analyzing such platforms are of interest. In prior work, the real-time
calculus framework has proven to be very effective in this regard. However, real-time
calculus has heretofore been limited to systems with uniprocessor processing ele-
ments, which is a serious impediment given the advent of multicore technologies. In
this paper, a two-step approach is proposed that allows the power of real-time calculus
to be applied in globally-scheduled multiprocessor systems: first, assuming that job
response-time bounds are given, determine whether these bounds are met; second,
using these bounds, determine the resulting residual processor supply and streams
of job completion events using formalisms from real-time calculus. For this method-
ology to be applied in settings where response-time bounds are not specified, such

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences