A case study of software load balancing policies implemented with the PGAS programming model

Górski, Łukasz; Bała, Piotr; Rakowski, Franciszek

doi:10.1109/hpcsim.2016.7568368

2016 International Conference on High Performance Computing &Amp; Simulation (HPCS) 2016

DOI: 10.1109/hpcsim.2016.7568368

|View full text |Cite

A case study of software load balancing policies implemented with the PGAS programming model

Łukasz Górski

Piotr Bała

Franciszek Rakowski

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The PCJ library won HPC Challenge award in 2014 and has been already successfully used for parallelization of selected applications. One of the applications utilizing PCJ is an application that uses a differential evolution algorithm to calculate the parameters of C. Elegans connectome model [13][14][15]. Another example is the parallelization of DNA (nucleotide) and protein sequence databases querying to find the most similar sequences to a given sequence [16,17].…”

mentioning

confidence: 99%

Comparison of sort algorithms in Hadoop and PCJ

Nowicki

2020

J Big Data

View full text Add to dashboard Cite

Sorting algorithms are among the most commonly used algorithms in computer science and modern software. Having efficient implementation of sorting is necessary for a wide spectrum of scientific applications. This paper describes the sorting algorithm written using the partitioned global address space (PGAS) model, implemented using the Parallel Computing in Java (PCJ) library. The iterative implementation description is used to outline the possible performance issues and provide means to resolve them. The key idea of the implementation is to have an efficient building block that can be easily integrated into many application codes. This paper also presents the performance comparison of the PCJ implementation with the MapReduce approach, using Apache Hadoop TeraSort implementation. The comparison serves to show that the performance of the implementation is good enough, as the PCJ implementation shows similar efficiency to the Hadoop implementation.

show abstract

mentioning

confidence: 99%

Comparison of sort algorithms in Hadoop and PCJ

Nowicki

2020

J Big Data

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A case study of software load balancing policies implemented with the PGAS programming model

Cited by 1 publication

References 12 publications

Comparison of sort algorithms in Hadoop and PCJ

Comparison of sort algorithms in Hadoop and PCJ

Contact Info

Product

Resources

About