A refinement methodology for developing Data-Parallel applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1123, Issue , 1996, Pages 145-150

  Nyland, Lars ^a   Prins, Jan ^a   Goldberg, Allen ^b   Mills, Peter ^c   Reif, John ^c   Wagner, Robert ^c  

^a Brooks Computer Science Building   (United States)

^b KESTREL INSTITUTE   (United States)

^c Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; SOFTWARE DESIGN;

ARCHITECTURAL MODELS; DATA DECOMPOSITION; DATA PARALLELISM; DATA-PARALLEL APPLICATIONS; DEVELOPMENT ACTIVITY; HIGH LEVEL SPECIFICATION; MULTI-TARGET TRACKING; PARALLEL COMPUTATION;

COST BENEFIT ANALYSIS;

EID: 84955559773     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61626-8_18     Document Type: Conference Paper

References (14)

1. B. Alpem, L. Carter, and E. Feig. Uniform memory hierarchies. In Proc. Foundations of Computer Science, 1990.
2. John K. Antonio. Architectural influences on task scheduling: A case study implementation of the jpda algorithm. Technical Report RL-TR-94-200, Rome Laboratory, Nov. 1994.
3. J. Backus. Can programming be liberated from the von neumann style? a functional style and its algebra ofprograms. Comm. of the ACM, 21(8):613-641,1978.
4. Guy E. Blelloch. Programming parallel algorithms. CACM, 39(3), Mar. 1996.
5. David C. Cann. SISAL 1.2: A brief introduction and tutorial. Technical report, Lawrence Livermore National Laboratory, 1993.
6. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eieken. LogP: Towards a realistic model of parallel computation. In Proc. Symposium on Principles and Practice of Parallel Programming, 1993.
7. Ian Foster. Designing and building parallel programs. Addison Wesley, 1995.
8. Richard A. Games, John D. Ramsdell, and Joseph J. Rushanan. Techniques for real-time parallel processing: Sensor processing case studies. Technical Report MTR 93B0000186, MITRE, April 1994.
9. Allen Goldberg, Peter Mills, Lars Nyland, Jan Prins, John Reif, and James Riely. Specification and development of parallel algorithms with the proteus system. In G. Blelloch, M. Chandy, and S. Jagannathan, editors, Specification of Parallel Algorithms. American Mathematical Society, 1994.
10. Lars S. Nyland, Jan E Prins, Allen T. Goldberg, Peter H. Mills, John H. Reif, and Robert A. Wagner. A design methodology for data-parallel applications. Technical report, Univ. of N. Carolina, 1995. Available as http:llwww.cs.unc.edu/Research/aipdesign.
11. Jan Prins and Daniel Palmer. Transforming high-level data-parallel programs into vector operations, In Proceedings of Principles and Practice of Parallel Programming, pages 119-128, San Diego, CA, 1993.
12. Leslie G Valiant. A bridging model for parallel computation. CACM, 33(8):103, August 1990.
13. Robert A. Wagner. Task parallel implementation ofthejpda algorithm. Technical report, Department of Computer Science, Duke University, Durham, NC 27708-0129, June 1995
14. B. Zhou and N. K. Bose. An efficient algorithm for data association in multitarget tracking. IEEE Trans. on Aerospace and Electronic Systems, 31 (1):458-468, 1995.