header
Image from OpenLibrary

Garbage collection in distributed memory systems / Ali Mahmoud Ali Al Hour ; Supervised Fatma A.Omara , Laila Nasef , Mohamed Nour El Dien

By: Contributor(s): Language: Eng Publication details: Cairo : Ali Mahmoud Ali Al Hour , 2006Description: 71P ; 30cmOther title:
  • اعادة استخدام اماكن الذاكرة الشاغرة فى النظم ذات الذاكرة الموزعة [Added title page title]
Subject(s): Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (M.Sc.) - Cairo University - Faculty Of Computers and Information - Department Of Computer Science Summary: The work in this thesis presents a new algorithm to parallel copying GC on distributed memory systems appropriate for java and other object - oriented languages This algorithm is called Mark and Copy Garbage Collection (M and CGC) algorithm , and it based on allocation process which concerns about how to allocate objects and GC process concerns about how to collect the garbage objects The GC process is implemented using two sub - processes , mark process to mark live objects in the heap and copy process to moved live objects from region to another our algorithm always out - performs the developed M and SGC algorithm with respect to the execution time and the average execution time
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.03.M.Sc.2006.Al.G (Browse shelf(Opens below)) Not for loan 01010110046599000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.03.M.Sc.2006.Al.G (Browse shelf(Opens below)) 46599.CD Not for loan 01020110046599000

Thesis (M.Sc.) - Cairo University - Faculty Of Computers and Information - Department Of Computer Science

The work in this thesis presents a new algorithm to parallel copying GC on distributed memory systems appropriate for java and other object - oriented languages This algorithm is called Mark and Copy Garbage Collection (M and CGC) algorithm , and it based on allocation process which concerns about how to allocate objects and GC process concerns about how to collect the garbage objects The GC process is implemented using two sub - processes , mark process to mark live objects in the heap and copy process to moved live objects from region to another our algorithm always out - performs the developed M and SGC algorithm with respect to the execution time and the average execution time

Issued also as CD

There are no comments on this title.

to post a comment.