Chewoo Na
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chewoo Na has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Binoy Ravindran
Virginia Tech, Blacksburg, USA
2 shared publications - E. Douglas Jensen
The MITRE Corporation
1 shared publication - Hyeonjoong Cho
Department of Computer Convergence Software, Korea University, Sejong, South Korea
1 shared publication - Hyeonjoong Cho
ETRI, Daejoen, South Korea
1 shared publication
Latest Publications
- 2 February 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 20 (6) , 845-856
Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems
We consider garbage collection (GC) in dynamic, multiprocessor real-time systems. We consider the time-based, concurrent GC approach and focus on real-time scheduling to obtain mutator timing assurances, despite memory allocation and garbage collection. We present a scheduling algorithm 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 establish that GCMUA probabilistically lower bounds each mutator activity's accrued utility, lower bounds the system-wide total accrued utility, and upper bounds the timing assurances' sensitivity to variations in mutator execution-time and memory demand estimates. Our simulation experiments validate our analytical results and confirm GCMUA's effectiveness.
- 2 February 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 20 (6) , 845-856
Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems
We consider garbage collection (GC) in dynamic, multiprocessor real-time systems. We consider the time-based, concurrent GC approach and focus on real-time scheduling to obtain mutator timing assurances, despite memory allocation and garbage collection. We present a scheduling algorithm 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 establish that GCMUA probabilistically lower bounds each mutator activity's accrued utility, lower bounds the system-wide total accrued utility, and upper bounds the timing assurances' sensitivity to variations in mutator execution-time and memory demand estimates. Our simulation experiments validate our analytical results and confirm GCMUA's effectiveness.
- 15 April 2007
- Published by Springer Nature in Real-Time Systems
- Vol. 36 (1-2) , 23-46
On scheduling garbage collector in dynamic real-time systems with statistical timing assurances
- 15 April 2007
- Published by Springer Nature in Real-Time Systems
- Vol. 36 (1-2) , 23-46
On scheduling garbage collector in dynamic real-time systems with statistical timing assurances