Efficient object sharing in quantum-based real-time systems
被引:13
作者:
Anderson, JH
论文数: 0引用数: 0
h-index: 0
机构:
Univ N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USAUniv N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USA
Anderson, JH
[1
]
Jain, R
论文数: 0引用数: 0
h-index: 0
机构:
Univ N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USAUniv N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USA
Jain, R
[1
]
Jeffay, K
论文数: 0引用数: 0
h-index: 0
机构:
Univ N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USAUniv N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USA
Jeffay, K
[1
]
机构:
[1] Univ N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USA
来源:
19TH IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS
|
1998年
关键词:
D O I:
10.1109/REAL.1998.739768
中图分类号:
TP3 [计算技术、计算机技术];
学科分类号:
0812 ;
摘要:
We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum-based systems, the size of the quantum is quite large in comparison to the length of an object call. As a result, most object calls can be expected to execute without preemption. A good object-sharing scheme should optimize for this expected case, while achieving low overhead when preemptions do occur In this paper we present several new shared-object algorithms for uniprocessors and multiprocessors that were designed based upon this principle. We also present scheduling analysis results that can be used in conjunction with these algorithms.