Hyeonjoong Cho
Research Subjects
Hyeonjoong Cho has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
B. Ravindran
Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA
1 shared publication- Binoy Ravindran
Virginia Tech, Blacksburg, USA
1 shared publication - E. Douglas Jensen
The MITRE Corporation
1 shared publication E.D. Jensen
1 shared publication
Latest Publications
- 1 January 2008
- Published by Springer Nature
- p. 73-85
Lock-Free Synchronization for Dynamic Embedded Real-Time Systems
- 1 January 2008
- Published by Springer Nature
- p. 73-85
Lock-Free Synchronization for Dynamic Embedded Real-Time Systems
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15301591) , 1-6
Lock-Free Synchronization for Dynamic Embedded Real-Time Systems
We consider lock-free synchronization for dynamic embedded real-time systems that are subject to resource overloads and arbitrary activity arrivals. We model activity arrival behaviors using the unimodal arbitrary arrival model (or UAM). UAM embodies a stronger "adversary" than most traditional arrival models. We derive the upper bound on lock-free retries under the UAM with utility accrual scheduling - the first such result. We establish the tradeoffs between lock-free and lock-based sharing under UAM. These include conditions under which activities' accrued timeliness utility is greater under lock-free than lock-based, and the consequent upper bound on the increase in accrued utility that is possible with lock-free. We confirm our analytical results with a POSIX RTOS implementation
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15301591) , 1-6
Lock-Free Synchronization for Dynamic Embedded Real-Time Systems
We consider lock-free synchronization for dynamic embedded real-time systems that are subject to resource overloads and arbitrary activity arrivals. We model activity arrival behaviors using the unimodal arbitrary arrival model (or UAM). UAM embodies a stronger "adversary" than most traditional arrival models. We derive the upper bound on lock-free retries under the UAM with utility accrual scheduling - the first such result. We establish the tradeoffs between lock-free and lock-based sharing under UAM. These include conditions under which activities' accrued timeliness utility is greater under lock-free than lock-based, and the consequent upper bound on the increase in accrued utility that is possible with lock-free. We confirm our analytical results with a POSIX RTOS implementation