Article

Free access

Experiences with poker

Authors:

Lawrence Snyder,

Mary L. Bailey,

Bruce Forstall,

Willian G. Griswold,

Thomas J. Holman,

Gemini Lasswell,

Robert Mitchell,

Philip A. NelsonAuthors Info & Claims

PPEALS '88: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems

Pages 10 - 20

https://doi.org/10.1145/62115.62118

Published: 01 January 1988 Publication History

Abstract

Experience from over five years of building nonshared memory parallel programs using the Poker Parallel Programming Environment has positioned us to evaluate our approach to defining and developing parallel programs. This paper presents the more significant results of our evaluation of Poker. The evaluation is driving our next effort in parallel programming environment; many of the results should be sufficiently general to apply to other related efforts.

References

[1]

J.R. Allen, D. Callahan, and K. Kennedy. Automatic Decomposition of Scientific Programs for Parallel Execution. Conference Record of the 1Jth Annual A CM Symposium on the Principles of Programming Languages (January 1987).

Digital Library

[2]

D.A. Bailey and J.E. Cuny. Graph Grammar Based Specification of Intereonnection Structures for Massively Parallel Computation. In Graph- Grammars and Their Applications to Computer Science, H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld (editors). Lecture Notes in Computer Science 291, Springer-Verlag (1987).

Digital Library

[3]

P.D. Berman and L. Snyder. On Mapping Parallel Algorithms into Parallel Architectures. Proceedings of the International Conference on Parallel Processing (1984).

[4]

W.P. Crowley, C.P. Hendriekson, T.L. Rudy. The Simple Code. Technical Report UCID-17715, Lawrence Livermore Lab. (February 1978).

[5]

A.K. Dewdney. Computer Recreations, Scientific American (December 1984).

[6]

K. Gates and D. Socha. Programming N-cubes with a Graphical Parallel Programming Environment versus an Extended Sequential Language. In Hypercube Multiprocessors 198 7: Proceedings of the 2nd Conference on Hypercube Multiprocessors (1087).

[7]

R.B. Grafton and T. Ichikawa, editors. Special Issue on Visual Programming, IEEE Computer 18,8 (August 1985).

[8]

T.J. Holman. An Evaluation of Floating Point Hardware in Parallel Computers. Technical Report 87-12-09, Department of Computer Science, University of Washington (December 1987).

[9]

T.J. Holman and L. Snyder. A Transparent Coprocessor for interprocessor Communication in an MIMD Computer. Technical Report 87-03-07, Department of Computer Science, University of Washington (March 1987).

[10]

D.J. Kuck, R.H. Kuhn, B. Leasure, and M. Wolfe. The Structure of an Advanced Vectorizer for Pipelined Processors. Proceedings of the 4th International Computer Software and Applications Conference (1980).

[11]

H.T. Kung and C.E. Leiserson. Algorithms for VLSI Processor Arrays. in Introduction to VLSI Systems, C. Mead and L. Conway. Addison-Wesley (1980).

[12]

P.A. Nelson. A Non-Systolic Matrix Product Algorithm. Technical Report 85-11-02. Department of Computer Science, University of Washington (November 1985).

[13]

P.A. Nelson. Parallel Programming Paradigms. PhD Thesis. Technical Report 87-07-02, Department of Computer Science, University of Washington (July 1987).

Digital Library

[14]

J.T. Schwartz. Ultraeomputers. A CM Transactions on Programming Languages and Systems ~,4 (October 1980).

Digital Library

[15]

L. Snyder and D. Socha. Poker on the Cosmic Cube: The First Retargettable Parallel Programming Language and Environment. Proceedings of ~he International Conference on Parallel Processing (1986).

[16]

L. Snyder. Type Architectures, Shared Memory and the Corollary of Modest Potential. In Annual Review of Computer Science, Volume 1 (1986).

Digital Library

[17]

L. Snyder. Poker 4.0: A Programmer's Reference Guide. Technical Report 86-05-04, Department of Computer Science, University of Washington (1986).

[18]

L. Snyder. Parallel Programming and the Poker Programming Environment. IEEE Computer 17,7 (July 1984).

[19]

L. Snyder. Introduction to the Configurable Highly Parallel Computer. IEEE Computer 15,1 (January 1982).

[20]

D. Socha, M. Bailey, and D. Notkin. Voyeur: Graphical Views of Parallel Programs. A CM SIC- PLAN and SIGOPS Workshop on Parallel and Distributed Debugging (May 1988).

Digital Library

Cited By

Yanhaona MGrimshaw AWang ZPetoumenos PLeather H(2015)A Roadmap for a Type Architecture Based Parallel Programming LanguageProceedings of the 2015 International Workshop on Code Optimisation for Multi and Many Cores10.1145/2723772.2723774(1-10)Online publication date: 8-Feb-2015
https://dl.acm.org/doi/10.1145/2723772.2723774
Chamberlain BChoi SLewis ESnyder LWeathersby WLin C(1998)The Case for High-Level Parallel Programming in ZPLIEEE Computational Science & Engineering10.1109/99.7146045:3(76-86)Online publication date: 1-Jul-1998
https://dl.acm.org/doi/10.1109/99.714604
Alverson GGriswold WLin CNotkin DSnyder L(1998)Abstractions for Portable, Scalable Parallel ProgrammingIEEE Transactions on Parallel and Distributed Systems10.1109/71.6552469:1(71-86)Online publication date: 1-Jan-1998
https://dl.acm.org/doi/10.1109/71.655246
Show More Cited By

Index Terms

Experiences with poker

Recommendations

Experiences with poker
Proceedings of the ACM/SIGPLAN PPEALS 1988

Experience from over five years of building nonshared memory parallel programs using the Poker Parallel Programming Environment has positioned us to evaluate our approach to defining and developing parallel programs. This paper presents the more ...
Poker-CNN: a pattern learning strategy for making draws and bets in poker games using convolutional networks
AAAI'16: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence

Poker is a family of card games that includes many variations. We hypothesize that most poker games can be solved as a pattern matching problem, and propose creating a strong poker playing system based on a unified poker representation. Our poker player ...
Experiences with Sweep3D implementations in Co-array Fortran

As part of the recent focus on increasing the productivity of parallel application developers, Co-array Fortran (CAF) has emerged as an appealing alternative to the Message Passing Interface (MPI). CAF belongs to the family of global address space ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PPEALS '88: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems

January 1988

246 pages

ISBN:0897912764

DOI:10.1145/62115

Editor:
Richard L. Wexelblat
Philips Labs., Briarcliff Manor, NY

ACM SIGPLAN Notices Volume 23, Issue 9
Proceedings of the ACM/SIGPLAN PPEALS 1988
Sept. 1988
246 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/62116
Editor:
Richard L. Wexelblat
Philips Labs., Briarcliff Manor, NY
Issue’s Table of Contents

Copyright © 1988 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PPEALS88

Sponsor:

SIGPLAN

PPEALS88: Parallel Programming: Experience with Applications, Language & Systems

July 19 - 21, 1988

Connecticut, New Haven, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
655
Total Downloads

Downloads (Last 12 months)104
Downloads (Last 6 weeks)19

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Yanhaona MGrimshaw AWang ZPetoumenos PLeather H(2015)A Roadmap for a Type Architecture Based Parallel Programming LanguageProceedings of the 2015 International Workshop on Code Optimisation for Multi and Many Cores10.1145/2723772.2723774(1-10)Online publication date: 8-Feb-2015
https://dl.acm.org/doi/10.1145/2723772.2723774
Chamberlain BChoi SLewis ESnyder LWeathersby WLin C(1998)The Case for High-Level Parallel Programming in ZPLIEEE Computational Science & Engineering10.1109/99.7146045:3(76-86)Online publication date: 1-Jul-1998
https://dl.acm.org/doi/10.1109/99.714604
Alverson GGriswold WLin CNotkin DSnyder L(1998)Abstractions for Portable, Scalable Parallel ProgrammingIEEE Transactions on Parallel and Distributed Systems10.1109/71.6552469:1(71-86)Online publication date: 1-Jan-1998
https://dl.acm.org/doi/10.1109/71.655246
Bode ABode ABrüning UChapman BDal Cin MHändler WHertweck FHerzog UHofmann FKlar RLinster CRosenstiel WSchneider HWedeck JWaldschmidt KZima H(1995)Werkzeuge zur Entwicklung paralleler ProgrammeParallelrechner10.1007/978-3-322-86771-1_13(517-562)Online publication date: 1995
https://doi.org/10.1007/978-3-322-86771-1_13
Magee JDulay NKramer J(1994)A constructive development environment for parallel and distributed programsProceedings of 2nd International Workshop on Configurable Distributed Systems10.1109/IWCDS.1994.289940(4-14)Online publication date: 1994
https://doi.org/10.1109/IWCDS.1994.289940
Lin CSnyder L(1994)Accommodating polymorphic data decompositions in explicitly parallel programsProceedings of 8th International Parallel Processing Symposium10.1109/IPPS.1994.288317(68-74)Online publication date: 1994
https://doi.org/10.1109/IPPS.1994.288317
Bailey MPagels MWong K(1993)How using busses in multicomputer programs affects conservative parallel simulationACM SIGSIM Simulation Digest10.1145/174134.15847123:1(93-100)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/174134.158471
Feldmann AStricker TWarfel TSnyder L(1993)Supporting sets of arbitrary connections on iWarp through communication context switchesProceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures10.1145/165231.165257(203-212)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1145/165231.165257
Bailey MPagels MWong K(1993)How using busses in multicomputer programs affects conservative parallel simulationProceedings of the seventh workshop on Parallel and distributed simulation10.1145/158459.158471(93-100)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/158459.158471
Magee JKramer JDulay N(1993)Darwin/MP: an environment for parallel and distributed programming[1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences10.1109/HICSS.1993.284094(337-346)Online publication date: 1993
https://doi.org/10.1109/HICSS.1993.284094
Show More Cited By

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

Media

Figures

Other

Tables

View Table of Contents