loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)
Sydney, Australia
August 16-August 18
ISBN: 0-7695-2676-4
ASCII Text
x 
 
Chewoo Na, Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen, "Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems," Real-Time Computing Systems and Applications, International Workshop on, pp. 101-105, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/RTCSA.2006.34,
author = {Chewoo Na and Hyeonjoong Cho and Binoy Ravindran and E. Douglas Jensen},
title = {Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems},
journal ={Real-Time Computing Systems and Applications, International Workshop on},
volume = {0},
year = {2006},
issn = {1533-2306},
pages = {101-105},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2006.34},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Computing Systems and Applications, International Workshop on
TI - Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems
SN - 1533-2306
SP101
EP105
A1 - Chewoo Na,
A1 - Hyeonjoong Cho,
A1 - Binoy Ravindran,
A1 - E. Douglas Jensen,
PY - 2006
KW - null
VL - 0
JA - Real-Time Computing Systems and Applications, International Workshop on
ER -
 
Chewoo Na, Virginia Tech, USA
Hyeonjoong Cho, Virginia Tech, USA
Binoy Ravindran, Virginia Tech, USA
E. Douglas Jensen, The MITRE Corporation, USA
We present a garbage collector scheduling algorithm for dynamic multiprocessor real-time systems called GCMUA. The algorithm considers mutator activities that are subject to time/utility function time constraints, stochastic execution-time and memory demands, and overloads. We prove that GCMUA probabilistically lower bounds each mutator?s accrued utility, lower bounds the total accrued utility, and upper bounds the assurances? sensitivity to variations in execution-time and memory demand estimates. Our simulation results confirm our analytical results.
Citation:
Chewoo Na, Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen, "Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems," rtcsa, pp.101-105, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.