Earticle

초록

영어

Most parallel garbage collection algorithms are based on the mark-and-collect technique. A mark-and-collect technique an effective asynchronous marking algorithm. There are two basic marking techniques: coloring and stacking. The coloring technique is asynchronous but its time complexity is O(MN) where M and N are the total number of nodes in the list memory and the total number of active nodes, respectively. The stacking technique offers effective marking process having only O(N) time complexity but requires extra stack space which can be as large as the size of entire active nodes(N). A new parallel garbage collection algorithm in ubiquitous environment has been devised which takes advantage of the asynchronous processing of coloring algorithms and the time efficiency of stacking algorithms. The algorithm requires no synchronization between the collectors and the mutators. and its tome complexity is close to O(N) with a small fixed-size stack in ubiquitous real-time system.

목차

Abstract
 1. Introduction
 2. Garbage Collection in Ubiquitous Real-time System
 3. Algorithm Model in Ubiquitous Real-time System
 4. Correctness of the Algorithm in Ubiquitous Real-time System
 5. Time Complexity in the Ubiquitous Real-time System
 6. Conclusions
 References

키워드

저자

• Sang-Young Lee [ Department of Health Administration, Namseoul University, Cheonan, South Korea ]
• Yoon-Seok Lee [ Department of Health Administration, Namseoul University, Cheonan, South Korea ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Control and Automation

• 간기

  월간

• pISSN

  2005-4297

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605