Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2442992.2442996acmconferencesArticle/Chapter ViewAbstractPublication PagesppoppConference Proceedingsconference-collections
research-article

The JStar language philosophy

Published: 23 February 2013 Publication History

Abstract

This paper introduces the JStar parallel programming language, which is a Java-based declarative language aimed at discouraging sequential programming, encouraging massively parallel programming, and giving the compiler and runtime maximum freedom to try alternative parallelisation strategies. We describe the execution semantics and runtime support of the language, several optimisations and parallelism strategies, with some initial benchmark results.

References

[1]
P. Alvaro, W. R. Marczak, N. Conway, J. M. Hellerstein, D. Maier, and R. Sears. Dedalus: Datalog in time and space. In de Moor et al. {9}, pages 262--281.
[2]
R. Barjavel. Le Voyageur Imprudent (The Imprudent Traveller). Arthéme Fayard, France, 1943. Published in the journal Je suis partout.
[3]
P. Beard. Easy parallelism. COMP520 Report, Department of Computer Science, The University of Waikato, Hamilton, New Zealand, 2009.
[4]
R. L. Bocchino Jr., V. S. Adve, S. V. Adve, and M. Snir. Parallel programming must be deterministic by default. In Proceedings of the First USENIX Conference on Hot Topics in Parallelism, pages 4--4, Berkeley, CA, USA, 2009. USENIX Association.
[5]
H. Chafi, A. K. Sujeeth, K. J. Brown, H. Lee, A. R. Atreya, and K. Olukotun. A domain-specific approach to heterogeneous parallelism. In C. Cascaval and P.-C. Yew, editors, PPOPP, pages 35--46. ACM, 2011.
[6]
R. Clayton. Compilation of Bottom-Up Evaluation for a Pure Logic Programming Language. PhD thesis, Dept. of Computer Science, The Univ. of Waikato, Hamilton, NZ, 2004.
[7]
J. G. Cleary, M. Utting, and R. Clayton. Datalog as a parallel general purpose programming language. Technical Report 06/2010, Department of Computer Science, The University of Waikato, Hamilton, New Zealand, Aug. 2010. Available from http://www.cs.waikato.ac.nz/pubs/wp.
[8]
S. Crosby. Parallelization of JStar programs on a distributed computer. Master's thesis, Department of Computer Science, The University of Waikato, 2012.
[9]
O. de Moor, G. Gottlob, T. Furche, and A. J. Sellers, editors. Datalog Reloaded - First International Workshop, Datalog 2010, Oxford, UK, March 16--19, 2010. Revised Selected Papers, volume 6702 of Lecture Notes in Computer Science. Springer, 2011.
[10]
D. Lea. A Java fork/join framework. In Proceedings of the ACM 2000 conference on Java Grande, JAVA '00, pages 36--43, New York, NY, USA, 2000. ACM.
[11]
S. McCommell. Code Complete: A Practical Handbook of Software Construction. Microsoft Press, 2nd edition, 2004.
[12]
T. C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In Foundations of Deductive Databases and Logic Programming., pages 193--216. Morgan Kaufmann, San Francisco, CA, 1988.
[13]
D. A. Smith and M. Utting. Pseudo-naive evaluation. In Tenth Australasian Database Conference, ADC'99, Auckland, NZ, Jan 1999, Berlin, 1999. Springer-Verlag.
[14]
S. T. Taft. Experimenting with Parasail: parallel specification and implementation language. Ada Lett., 31(3):11--12, Nov. 2011.
[15]
J. D. Ullman. Bottom-up beats top-down for Datalog. In PODS '89: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pages 140--149, New York, NY, USA, 1989. ACM.
[16]
U. Vishkin. Using simple abstraction to reinvent computing for parallelism. CACM, 54(1):75--85, Jan. 2011.

Cited By

View all
  • (2023)A Comprehensive Exploration of Languages for Parallel ComputingACM Computing Surveys10.1145/348500855:2(1-39)Online publication date: 31-Mar-2023

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
PMAM '13: Proceedings of the 2013 International Workshop on Programming Models and Applications for Multicores and Manycores
February 2013
134 pages
ISBN:9781450319089
DOI:10.1145/2442992
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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 February 2013

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. JStar
  2. Java
  3. Linda-like languages
  4. architecture independence
  5. datalog
  6. parallel programming models
  7. parallel-programming language
  8. performance optimisation

Qualifiers

  • Research-article

Funding Sources

Conference

PPoPP '13
Sponsor:

Acceptance Rates

Overall Acceptance Rate 53 of 97 submissions, 55%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)1
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2023)A Comprehensive Exploration of Languages for Parallel ComputingACM Computing Surveys10.1145/348500855:2(1-39)Online publication date: 31-Mar-2023

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media