Article

Free access

A Java fork/join framework

Author:

Doug LeaAuthors Info & Claims

JAVA '00: Proceedings of the ACM 2000 conference on Java Grande

Pages 36 - 43

https://doi.org/10.1145/337449.337465

Published: 03 June 2000 Publication History

PDF eReader

References

[1]

Agesen, Ole, David Detlefs, and J. Eliot B. Moss. Garbage Collection and Local Variable Type-Precision and Liveness in Java Virtual Machines. In Proceedings of 1998 ACM SIGPLAN Conference on Programming Language Design and implementation (PLDI), 1998.

Digital Library

Google Scholar

[2]

Agesen, Ole, David Detlefs, Alex Garthwaite, Ross Knippel, Y.S. Ramakrishna, and Derek White. An Efficient Meta-lock for Implementing Ubiquitous Synchronization. In Proceedings of OOPSLA '99, ACM, 1999.

Digital Library

Google Scholar

[3]

Arora, Nimar, Robert D. Blumofe, and C. Greg Plaxton. Thread Scheduling for Multiprogrammed Multiprocessors. In Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Puerto Vallarta, Mexico, June 28 - july 2, 1998.

Digital Library

Google Scholar

[4]

Blumofe, Robert D. and Dionisios Papadopoulos. Hood: A User-Level Threads Library for Multiprogrammed Multiprocessors. Technical Report, University of Texas at Austin, 1999.

Google Scholar

[5]

Ffigo, Matteo, Charles Leiserson, and Keith Randall. The Implementation of the Cilk-5 Multithreaded Language. in Proceedings of 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 1998.

Digital Library

Google Scholar

[6]

Gosling, James, Bill Joy, and Guy Steele. The Java Language Specification, Addison-Wesley, 1996.

Digital Library

Google Scholar

[7]

Lea, Doug. Concurrent Programming in Java, second edition, Addison-Wesley, 1999.

Digital Library

Google Scholar

[8]

Lowenthal, David K., Vincent W. Freeh, and Gregory R. Andrews. Efficient Fine-Grain Parallelism on Shared- Memory Machines. Concurrency-Practice and Experience, 10,3:157-173, 1998.

Crossref

Google Scholar

[9]

Simpson, David, and F. Warren Burton. Space efficient execution of deterministic parallel programs. IEEE Transactions on Software Engineering, December, 1999.

Digital Library

Google Scholar

[10]

Taura, Kenjiro, Kunio Tabata, and Akinori Yonezawa. "Stackthreads/MP: Integrating Futures into Calling Standards." In Proceedings of ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP), 1999.

Digital Library

Google Scholar

Cited By

View all

Arora JMuller SAcar U(2024)Disentanglement with Futures, State, and InteractionProceedings of the ACM on Programming Languages10.1145/36328958:POPL(1569-1599)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632895
Westrick SFluet MRainey MAcar U(2024)Automatic Parallelism ManagementProceedings of the ACM on Programming Languages10.1145/36328808:POPL(1118-1149)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632880
Kaler TChen XWheatman BCurtis DHoppe BSchardl TLeiserson C(2024)Speedcode: Software Performance Engineering Education via the Coding of Didactic Exercises2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW63119.2024.00087(391-394)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPSW63119.2024.00087
Show More Cited By

Index Terms

A Java fork/join framework
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management

Recommendations

Bounds for Two Server Fork-Join Queueing Systems
Analysis of the Fork-Join Queue

A fork-join queue is considered as a typical model of parallel processing systems with arrival and departure synchronizations. An approach for obtaining the transient and the steady-state solutions of the fork-join queue in terms of the virtual waiting ...
On the probability distribution of join queue length in a fork-join model

In this article, we consider the two-node fork-join model with a Poisson arrival process and exponential service times of heterogeneous service rates. Using a mapping from the queue lengths in the parallel nodes to the join queue length, we first derive ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

JAVA '00: Proceedings of the ACM 2000 conference on Java Grande

June 2000

179 pages

ISBN:1581132883

DOI:10.1145/337449

Chairmen:
Dennis Gannon
Indiana Univ.; and NASA Ames Research Center
,
Piyush Mehrotra
ICASE

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 June 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

JAVA00

Sponsor:

SIGPLAN

JAVA00: ACM 2000 Java Grande Conference

June 3 - 4, 2000

California, San Francisco, USA

Acceptance Rates

JAVA '00 Paper Acceptance Rate 20 of 55 submissions, 36%;

Overall Acceptance Rate 40 of 93 submissions, 43%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

354
Total Citations
View Citations
2,088
Total Downloads

Downloads (Last 12 months)266
Downloads (Last 6 weeks)36

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Arora JMuller SAcar U(2024)Disentanglement with Futures, State, and InteractionProceedings of the ACM on Programming Languages10.1145/36328958:POPL(1569-1599)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632895
Westrick SFluet MRainey MAcar U(2024)Automatic Parallelism ManagementProceedings of the ACM on Programming Languages10.1145/36328808:POPL(1118-1149)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632880
Kaler TChen XWheatman BCurtis DHoppe BSchardl TLeiserson C(2024)Speedcode: Software Performance Engineering Education via the Coding of Didactic Exercises2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW63119.2024.00087(391-394)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPSW63119.2024.00087
Contreras-Torres EMarrero-Ponce Y(2024)MD-LAIs Software: Computing Whole-Sequence and Amino Acid-Level “Embeddings” for Peptides and ProteinsJournal of Chemical Information and Modeling10.1021/acs.jcim.3c0118964:23(8665-8672)Online publication date: 18-Nov-2024
https://doi.org/10.1021/acs.jcim.3c01189
Castañeda APiña M(2024)Read/write fence-free work-stealing with multiplicityJournal of Parallel and Distributed Computing10.1016/j.jpdc.2023.104816186:COnline publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1016/j.jpdc.2023.104816
Reitz LFohry C(2024)Task-Level Checkpointing and Localized Recovery to Tolerate Permanent Node Failures for Nested Fork–Join Programs in ClustersSN Computer Science10.1007/s42979-024-02624-85:3Online publication date: 13-Mar-2024
https://dl.acm.org/doi/10.1007/s42979-024-02624-8
Wang XWang TXiang H(2024)A multi-threaded particle swarm optimization-kmeans algorithm based on MapReduceCluster Computing10.1007/s10586-024-04456-w27:6(8031-8044)Online publication date: 6-Apr-2024
https://doi.org/10.1007/s10586-024-04456-w
Reitz LFohry C(2024)Task-Level Checkpointing for Nested Fork-Join Programs Using Work StealingEuro-Par 2023: Parallel Processing Workshops10.1007/978-3-031-48803-0_9(102-114)Online publication date: 14-Apr-2024
https://doi.org/10.1007/978-3-031-48803-0_9
Saini HKumar VChakraborty T(2024)Energy efficient permanence‐based community detection algorithmConcurrency and Computation: Practice and Experience10.1002/cpe.829736:28Online publication date: 13-Oct-2024
https://doi.org/10.1002/cpe.8297
Callanan GGruian FZhu Qvon Hanxleden RStephen EBrandt J(2023)Scalable Actor Networks with CALProceedings of the 21st ACM-IEEE International Conference on Formal Methods and Models for System Design10.1145/3610579.3611074(169-179)Online publication date: 21-Sep-2023
https://dl.acm.org/doi/10.1145/3610579.3611074
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Bounds for Two Server Fork-Join Queueing Systems

Analysis of the Fork-Join Queue

On the probability distribution of join queue length in a fork-join model