Portable Runtime Support for Graph-oriented Parallel and Distributed Programming*

Proceedings - International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 2000

Volumn , Issue , 2000, Pages 72-77

  Cao, J ^a,b   Liu, Y ^b   Xie, L ^b   Mao, B ^a   Zhang, K ^c  

^a NANJING UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN AND IMPLEMENTATIONS; GRAPH ORIENTED PROGRAMMING; HIGH-LEVEL ABSTRACTION; HIGHER-LEVEL ABSTRACTION; PARALLEL AND DISTRIBUTED PROGRAMMING; PARALLEL VIRTUAL MACHINES; PROGRAMMING FRAMEWORK; RUN- TIME SYSTEMS; RUNTIME SUPPORT; RUNTIMES;

EID: 0037960950     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPAN.2000.900264     Document Type: Conference Paper

References (12)

1. B. Awerbuch, “A New Distributed Depth-First-Search Algorithm, Information Processing Letters, 20(1983,pp 147-150.
2. H. E. Bal, “Programming Distributed Systems”, Silicon Press, 1990.
3. J. Cao, L. Fernando, and K. Zhang, “Programming Distributed SystemsBased on Graphs”, Intensional Programming I, World Scientific Pub.Co. 1996,pp 83-95.
4. J. Cao, Alvin Chan, and K. Zhang, “Programming Dynamic Reconfigurable Web Server Groups Using the GOP Model”, Proc. 12th International Symposium on Languages for Intensional Programming, Athens, Greece,June 1999.
5. J. Cao, A. Chan and J. Cao, “PANTA A Graph-Oriented Programmable Active Network Transport Architecture”, Proc. IEEE Wireless Communications and Networking Conference, New Orleans, USA. Sep 1999. Volume: 3,Pp: 1293 -1297
6. N. Carriero, D. Gelemter and J. Leichter, “Distributed Data Structures in Linda”, Proc. 13th ACM Symp. on Principle of Programming Languages, St. Petersburg, FL, 1986, pp 236-242.
7. E.J.H Chang, “Echo Algorithms:Depth Parallel Operationson General Graphs”,IEEE Trans Sofrware Engineering,VOL. SE-8, NO. 4, July 1982,pp 391-401.
8. E. W. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numer. Math., 1, 1959.pp.269-271.
9. R.G. Gallager, P.A. Humblet and P.M. Spira,, “A Distributed Algorithm for Minimum-Weight Spanning Trees”, ACM Trans. Programming Languages and Systems,VOL. 5, NO. 1, Jan. 1983, 66-77 .
10. A. Geist, et al, “PVM Pxallel Virtual Machine: A User’s Guide and’htorial for Networked Parallel Computing”, MIT press.Cambridge,MA, 1994.
11. D. Peleg, “Distributed Data Structures: A Complexity-Oriented View,” Proc. 4th International Workshop on Distributed Data Algorithms, LNCS 486, 1990,pp. 71-89.
12. K. Schwan and W. Bo, “Topologies-Distributed Objects on Multi computers”, ACM Trans. Computer Systems, 8(2), May 1990,pplll-157.