Please use this identifier to cite or link to this item: https://doi.org/10.1109/CIT.2005.98
Title: Distributed code generation using object level analysis
Authors: Tay, T.T. 
Chu, Y.
Sun, Y.
Issue Date: 2005
Source: Tay, T.T., Chu, Y., Sun, Y. (2005). Distributed code generation using object level analysis. Proceedings - Fifth International Conference on Computer and Information Technology, CIT 2005 2005 : 858-862. ScholarBank@NUS Repository. https://doi.org/10.1109/CIT.2005.98
Abstract: A major issue for distributed computing systems is partitioning of the application and generating distributed code that can run correctly and efficiently on network machines. This paper introduced a new distributed code generation method using object level analysis, which is a key function of our Java Distributed code Generating and Computing platform (JDGC). Through a novel two-level object level analysis, the communication affinity metrics between runtime objects are extracted. These object-to-object affinity metrics are then used to automatically ports standard concurrent program for single machine to the form that runs on a distributed system. The contributions of this proposal are twofold. The object level analysis technique while motivated from our integrated system for object distribution, is nevertheless a general approach for extracting object-to-object communication affinity metrics and can be used in other contexts. The distributed code generation method releases the developers from any special programming considerations for distributed environment. © 2005 IEEE.
Source Title: Proceedings - Fifth International Conference on Computer and Information Technology, CIT 2005
URI: http://scholarbank.nus.edu.sg/handle/10635/69985
DOI: 10.1109/CIT.2005.98
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Feb 28, 2018

Page view(s)

10
checked on Feb 25, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.