Article

Free access

UC: a language for the connection machine

Authors:

E. KwanAuthors Info & Claims

Supercomputing '90: Proceedings of the 1990 ACM/IEEE conference on Supercomputing

Pages 525 - 534

Published: 01 October 1990 Publication History

Abstract

In designing parallel languages, the concern for defining a simple virtual machine must be balanced against the need to efficiently map a program on a specific architecture. UC addresses this problem by separating the programming task from efficiency considerations. UC programs are designed using a small set of constructs that include reduction, parallel assignment and fixed-point computation. The language also provides a map section that may optionally be used by a programmer to specify data mappings for the program. This paper describes the UC constructs and their current implementation on the Connection Machine. It also presents measurements of the compiler for simple benchmarks.

References

[1]

Arvind, R.S. Nikhil, and K.K. Pingali. I-structures: Data structures for parallel computing. In Workshop on Graph Reduction, September 1986.]]

Digital Library

[2]

R. Bagrodia and S. Mathur. Efficient implementation of high-level parallel programs. Technical Report CSD- 900022, Computer Science Dept, UCLA, Los Angeles, CA 90024, August 1990.]]

[3]

I. Chakravarty, 1990. Personal Communications.]]

[4]

K.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, Reading, Massachusetts, 1988.]]

Digital Library

[5]

H. Dietz and D. Klappholz. Refined C: A sequential language for parallel programming. In Proceedings of the International Conference on Parallel Processing, pages 442-449, August 1985.]]

[6]

S. Freudenberger, J. Schwartz, and M. Sharir. Experience with the SETL optimizer. ACM TOPLAS, 5(1), January 1983.]]

Digital Library

[7]

N. Gehani and A.D. McGettrick. Concurrent programming. Addison-Wesley, Reading, Massachusetts, 1988.]]

Digital Library

[8]

Dave Gelernter. Generative communication in Linda. ACM TOPLAS, 7(1), January 1985.]]

Digital Library

[9]

D.W. Hillis. The Connection Machine. The MIT Press, Cambridge, MA, 1985.]]

Digital Library

[10]

D.J. Kuck, E.S. Davidson, D.H. Lawrie, and A.H. Sameh. Parallel supercomputing today and the cedar approach. Science, pages 967-974, February 28 1986.]]

[11]

J.T. Kuehn and H.J. Siegel. Extensions to the c programming language for sired/mired parallelism. In Proceedings of the International Conference on Parallel Processing, pages 232-235, August 1985.]]

[12]

Edmund Kwan. The UC implementation on the Conrtection Machine. Comprehensive Report, July 1990.]]

[13]

Argonne NationM Laboratory. Using the Connection Machine System (CM Fortran). Technical report anl/mcs-tm-118, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, IL 60439, June 1989.]]

[14]

S. Mathur. Source to source transformations for UC. Master's Thesis, Computer Science Department, UCLA, August 1990.]]

[15]

R Perrott. A language for array and vector processors. ACM TOPLAS, 1(2), October 1'979.]]

Digital Library

[16]

J.R. Rose and G.L. Steele. C*: An extended c language for data parallel programming. Technical report PL- 87.5, Thinking Machirtes Corporation, March 1987.]]

[17]

C.L. Seitz, J. Seizovic, and Wen-King Su. The C programmer's abbreviated guide to multicomputer programming. Technical Report Caltech-CS-TR-88- 1, Dept. of Computer Sciences, California Institute of Technology, Los Angeles., January 1988.]]

Digital Library

[18]

United States Department Of De~ense. Reference Manual for the A da Programming Language, 1983.]]

Digital Library

Cited By

Robin YBic LEvripidou PBöhm WGaudiot J(1995)IPF for real-time image processing on massively parallel architecturesProceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques10.5555/224659.224934(234-243)Online publication date: 27-Jun-1995
https://dl.acm.org/doi/10.5555/224659.224934
Bagrodia RMathur S(1991)Efficient Implementation of high-level parallel programsACM SIGARCH Computer Architecture News10.1145/106975.37605319:2(142-151)Online publication date: 1-Apr-1991
https://dl.acm.org/doi/10.1145/106975.376053
Bagrodia RMathur S(1991)Efficient Implementation of high-level parallel programsACM SIGOPS Operating Systems Review10.1145/106974.37605325:Special Issue(142-151)Online publication date: 1-Apr-1991
https://dl.acm.org/doi/10.1145/106974.376053
Show More Cited By

Index Terms

Recommendations

An efficient fair UC-secure protocol for two-party computation

With the development of modern Internet and mobile networks, there is an increasing need for collaborative privacy-preserving applications. Secure multi-party computation SMPC gives a general solution to these applications and has become a hot topic. ...
A unified framework for UC from only OT
ASIACRYPT'12: Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security

In [1], the authors presented a unified framework for constructing Universally Composable (UC) secure computation protocols, assuming only enhanced trapdoor permutations. In this work, we weaken the hardness assumption underlying the unified framework ...
Blazing Fast OT for Three-Round UC OT Extension
Public-Key Cryptography – PKC 2020
Abstract
Oblivious Transfer (OT) is an important building block for multi-party computation (MPC). Since OT requires expensive public-key operations, efficiency-conscious MPC protocols use an OT extension (OTE) mechanism [Beaver 96, Ishai et al. 03] to ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

Supercomputing '90: Proceedings of the 1990 ACM/IEEE conference on Supercomputing

November 1990

982 pages

ISBN:0897914120

Co-chairs:
Daniel V. Pryor
Supercomputing Research Center
,
Gary Montry
Myrias Computer Corporation
,
General Chair:
Joanne L. Martin
IBM Corporation

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IEEE-CS: Computer Society

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 October 1990

Check for updates

Qualifiers

Article

Conference

SC '90

Sponsor:

SIGARCH
IEEE-CS

SC '90: International Conference for High Performance Computing, Networking, Storage and Analysis

November 12 - 16, 1990

New York, New York, USA

Acceptance Rates

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
111
Total Downloads

Downloads (Last 12 months)49
Downloads (Last 6 weeks)15

Reflects downloads up to 05 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Robin YBic LEvripidou PBöhm WGaudiot J(1995)IPF for real-time image processing on massively parallel architecturesProceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques10.5555/224659.224934(234-243)Online publication date: 27-Jun-1995
https://dl.acm.org/doi/10.5555/224659.224934
Bagrodia RMathur S(1991)Efficient Implementation of high-level parallel programsACM SIGARCH Computer Architecture News10.1145/106975.37605319:2(142-151)Online publication date: 1-Apr-1991
https://dl.acm.org/doi/10.1145/106975.376053
Bagrodia RMathur S(1991)Efficient Implementation of high-level parallel programsACM SIGOPS Operating Systems Review10.1145/106974.37605325:Special Issue(142-151)Online publication date: 1-Apr-1991
https://dl.acm.org/doi/10.1145/106974.376053
Bagrodia RMathur S(1991)Efficient Implementation of high-level parallel programsACM SIGPLAN Notices10.1145/106973.37605326:4(142-151)Online publication date: 1-Apr-1991
https://dl.acm.org/doi/10.1145/106973.376053
Bagrodia RMathur SPatterson DRau B(1991)Efficient Implementation of high-level parallel programsProceedings of the fourth international conference on Architectural support for programming languages and operating systems10.1145/106972.376053(142-151)Online publication date: 1-Apr-1991
https://dl.acm.org/doi/10.1145/106972.376053

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten