Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Yoo C. Chung"'
Autor:
Byung-sun Yang, Junpyo Lee, Seungil Lee, Seongbae Park, Yoo C. Chung, Suhyun Kim, Kemal Ebcioglu, Erik Altman, Soo-mook Moon
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 18:57-69
Publikováno v:
The Computer Journal. 48:437-442
Memory allocation is an important part of modern programming languages, including garbage-collected languages such as Java. We propose a fast memory allocation scheme for Java using lazy worst fit (LWF), where pointer increment is used as the primary
Publikováno v:
Software: Practice and Experience. 35:15-26
Traditional mark and sweep garbage collectors use time proportional to the heap size when sweeping memory, since all objects in the heap, dead or alive, must be traversed. Here we introduce a sweeping algorithm which traverses only the live objects.
Autor:
Erik R. Altman, Kemal Ebcioglu, Yoo C. Chung, Byung-Sun Yang, Soo-Mook Moon, Junpyo Lee, Suhyun Kim, Seungil Lee, Je Hyung Lee, Heung-Bok Lee
Publikováno v:
ACM SIGARCH Computer Architecture News. 28:21-33
Java, an object-oriented language, uses virtual methods to support the extension and reuse of classes. Unfortunately, virtual method calls affect performance and thus require an efficient implementation, especially when just-in-time (JIT) compilation
Publikováno v:
ACM SIGPLAN Notices. 35:79-81
Autor:
Yoo C. Chung, Soo-Mook Moon
Publikováno v:
ISMM
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy fits is introduced, where pointer increments, which is very fast, is us
Publikováno v:
POPL
Mark and sweep garbage collectors are known for using time proportional to the heap size when sweeping memory, since all objects in the heap, regardless of whether they are live or not, must be visited in order to reclaim the memory occupied by dead
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.