NDLI: Scalable Dynamic Load Balancing Using UPC

Content Provider	IEEE Xplore Digital Library
Author	Olivier, S. Prins, J.
Copyright Year	2008
Description	Author affiliation: Dept. of Comput. Sci., North Carolina Univ. - Chapel Hill, Chapel Hill, NC (Olivier, S.; Prins, J.)
Abstract	An asynchronous work-stealing implementation of dynamic load balance is implemented using Unified Parallel C (UPC) and evaluated using the Unbalanced Tree Search (UTS) benchmark [Olivier, S., et al., 2007]. The UTS benchmark presents a synthetic tree-structured search space that is highly imbalanced. Parallel implementation of the search requires continuous dynamic load balancing to keep all processors engaged in the search. Our implementation achieves better scaling and parallel efficiency in both shared memory and distributed memory settings than previous efforts using UPC [Olivier, S., et al., 2007] and MPI [Dinan, J., et al., 2007]. We observe parallel efficiency of 80% using 1024 processors performing over 85,000 total load balancing operations per second continuously. The UPC programming model provides substantial simplifications in the expression of the asynchronous work stealing protocol compared with MPI. However, to obtain performance portability with UPC in both shared memory and distributed memory settings requires the careful use of one sided reads and writes to minimize the impact of high latency communication. Additional protocol improvements are made to improve dissemination of available work and to decrease the cost of termination detection.
Starting Page	123
Ending Page	131
File Size	427227
Page Count	9
File Format	PDF
ISBN	9780769533742
ISSN	01903918
DOI	10.1109/ICPP.2008.19
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-09-09
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Program processors Search problems Load management Algorithm design and analysis Pediatrics Probes Benchmark testing performance analysis Unbalanced Tree Search benchmark load balancing Unified Parallel C work stealing unbalanced parallel computations distributed memory systems
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Scalable Dynamic Load Balancing Using UPC (2008)

UTS: An Unbalanced Tree Search Benchmark ⋆

UTS: An Unbalanced Tree Search Benchmark ⋆

Dynamic Load Balancing of Unbalanced Computations Using Message Passing

Dynamic load balancing of unbalanced computations using message passing (2007)

Scalable Load Distribution and Load Balancing for Dynamic Parallel Programs (1999)

UPC implementation of an unbalanced tree search benchmark,” Univ. North Carolina at Chapel Hill (2003)

Victim Selection and Distributed Work Stealing Performance: A Case Study

Scalable Load Balancing Strategies for Parallel A* Algorithms (1994)

Scalable Dynamic Load Balancing Using UPC

Similar Documents

Scalable Dynamic Load Balancing Using UPC (2008)

UTS: An Unbalanced Tree Search Benchmark ⋆

UTS: An Unbalanced Tree Search Benchmark ⋆

Dynamic Load Balancing of Unbalanced Computations Using Message Passing

Dynamic load balancing of unbalanced computations using message passing (2007)

Scalable Load Distribution and Load Balancing for Dynamic Parallel Programs (1999)

UPC implementation of an unbalanced tree search benchmark,” Univ. North Carolina at Chapel Hill (2003)

Victim Selection and Distributed Work Stealing Performance: A Case Study

Scalable Load Balancing Strategies for Parallel A* Algorithms (1994)

Scalable Dynamic Load Balancing Using UPC