NDLI: Partitioning Spatially Located Computations Using Rectangles

Content Provider	IEEE Xplore Digital Library
Author	Saule, E. Bas, E.O. Çatalyürek, U.V.
Copyright Year	2011
Abstract	The ideal distribution of spatially located heterogeneous workloads is an important problem to address in parallel scientific computing. We investigate the problem of partitioning such workloads (represented as a matrix of positive integers) into rectangles, such that the load of the most loaded rectangle (processor) is minimized. Since finding the optimal arbitrary rectangle-based partition is an NP-hard problem, we investigate particular classes of solutions, namely, rectilinear partitions, jagged partitions and hierarchical partitions. We present a new class of solutions called m-way jagged partitions, propose new optimal algorithms for m-way jagged partitions and hierarchical partitions, propose new heuristic algorithms, and provide worst case performance analyses for some existing and new heuristics. Moreover, the algorithms are tested in simulation on a wide set of instances. Results show that two of the algorithms we introduce lead to a much better load balance than the state-of-the-art algorithms.
Starting Page	709
Ending Page	720
File Size	1768394
Page Count	12
File Format	PDF
ISBN	9781612843728
ISSN	15302075
DOI	10.1109/IPDPS.2011.72
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-05-16
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Partitioning algorithms Heuristic algorithms Arrays Approximation algorithms Algorithm design and analysis Approximation methods Complexity theory
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

Multicore triangle computations without tuning

A traffic-aware top-N firewall approximation algorithm

A quasi-local algorithm for checking bisimilarity

Random polygon generation using ‘GRP_AS’ heuristic

Approximation Schemes for Maximum Weight Independent Set of Rectangles

Replica placement using genetic algorithm

A Two-step Discretization Algorithm Based on Rough Set

A maximum matching based heuristic algorithm for partial Latin square extension problem

The Complement of Hypergraph Capacitated Min-k-Cut Problem

Partitioning Spatially Located Computations Using Rectangles

Similar Documents

Multicore triangle computations without tuning

A traffic-aware top-N firewall approximation algorithm

A quasi-local algorithm for checking bisimilarity

Random polygon generation using ‘GRP_AS’ heuristic

Approximation Schemes for Maximum Weight Independent Set of Rectangles

Replica placement using genetic algorithm

A Two-step Discretization Algorithm Based on Rough Set

A maximum matching based heuristic algorithm for partial Latin square extension problem

The Complement of Hypergraph Capacitated Min-k-Cut Problem

Partitioning Spatially Located Computations Using Rectangles