A. M. Ali, KhayriA. Omara, FatmaA. Elshakankiry, Osama2020-02-032020-02-0320031. Khayri A. M. Ali, et al., " A Comparative Study of Parallel Copying Garbage Collection Schemes for Shared-memory Multiprocessors", to be published. 2. Khayri A. M. Ali, "A parallel Real-Time Garbage Collection Scheme for Shared-Memory Multiprocessors," In the Proceedings of the 31stAnnual Conferences on Statistics, Computer Science, and Operating Research, Cairo, December 1996. 3. Khayri A. M. Ali, "A Simple Parallel Generational Real-Time Garbage Collection Scheme for Shared-Memory Multiprocessors, " The Egyptian Computer Journal, ISSR, Cairo, JNIV, Vol.24, No.2, 1996. 4. Augmint: A multiprocessor Simulation Toolkit for Intel x86 Architectures. Source + executable + docs: http://www.csrd.uiuc.edu/iacoma. 5. H. Lieberman and C. E. Hewitt, "A Real-Time Garbage Collector based on the Lifetimes of Objects," Communications of the ACM, Vol.26, No.6, PP 419-429, 1983. 6. Tony Printezis and David Detlefs, "A Generational Mostly-concurrent Garbage Collector," SMLI TR-2000-88, June 2000. 7. Herbert Stoyan, "Early Lisp History (1956-1959)," Web version. http://www8 inforrnatik .uni-erlangen. de/ html/lisp/histlitl . html . 8. D. M. Ungar, "Generation scavenging A non-disruptive high performance storage reclamation algorithm," ACM SIGPLAN Notices, Vol.19, No.5, PP 157-167, April 1984. 9. Paul R. Wilson, "Uniprocessor Garbage Collection Techniques," Tech. Rep. University of Texas, January 1994.https://t.ly/V3YOnMSA Google ScholarIn this paper, an improved parallel generational copying real-time garbage collection scheme for shared-memory multiprocessors, which supports load balancing among workers, has been proposed, implemented, and evaluated. The basic idea of improvement is developed from Ali's two papers [2,3]. The scheme proposed here is a form of copying collectors that attempt to eliminate the drawback of frequently copying long-lived (stable) objects. This class of schemes is called generational-based schemes, which is based on concentrating the collection efforts on small areas of memory, so-called young generation. They reduce the need for collecting the remaining large areas of memory, old generation. A modified scheme, without real-time response, has also been implemented and compared to the real-time one. A comparative study has been done for the two schemes with other two parallel non-generational copying garbage collection schemes founded by the author in [1]. According to this comparative study, we proved that the performance of generational schemes is better than the performance of non-generational schemes. Also, the overheads occurred due to real-time response have been calculated.enOctober University for University of Shared-Memory MultiprocessorsParallel Generational CopyingArticle