NDLI: Data locality exploitation in the decomposition of regular domain problems

Please wait, while we are loading the content...

Data locality exploitation in the decomposition of regular domain problems

Content Provider	IEEE Xplore Digital Library
Author	Prieto, M. Llorente, I.M. Tirado, F.
Copyright Year	1990
Abstract	The aim of this paper is to study the effect of local memory hierarchy and communication network exploitation on message sending and the influence of this effect on the decomposition of regular applications. In particular, we have considered two different parallel computers, a Cray T3E-900 and an SGI Origin 2000. In both systems, the bandwidth reduction due to non-unit-stride memory access is quite significant and could be more important than the reduction due to contention in the network. These conclusions affect the choice of optimal decompositions for regular domains problems. Thus, although traditional 3D decompositions lead to lower inherent communication-to-computation ratios and could exploit more efficiently the interconnection network, lower dimensional decompositions are found to be more efficient due to the data decomposition effects on the spatial locality of the messages to be communicated. This increasing importance of local optimisations has also been shown using a well-known communication-computation overlapping technique which increases execution time, instead of reducing it as we could expect, due to poor cache memory exploitation.
Sponsorship	IEEE Computer Society
Starting Page	1141
Ending Page	1150
Page Count	10
File Size	838181
File Format	PDF
ISSN	10459219
Volume Number	11
Issue Number	11
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2000-11-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Concurrent computing Bandwidth Multiprocessor interconnection networks Costs Application software Cache memory Microprocessors Iterative algorithms Intelligent networks Communication networks
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computational Theory and Mathematics Hardware and Architecture

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

Performing permutations on interconnection networks by regularly changing switch states

Reducing PE/memory traffic in multiprocessors by the difference coding of memory addresses

Circuit simulation algorithms on a distributed memory multiprocessor system

Extended hypercube: a hierarchical interconnection network of hypercubes

Synchronization and communication costs of loop partitioning on shared-memory multiprocessor systems

Products of networks with logarithmic diameter and fixed degree

Work-efficient routing algorithms for rearrangeable symmetrical networks

Optimal software multicast in wormhole-routed multistage networks

Cycle embedding in a faulty hypercube

Data locality exploitation in the decomposition of regular domain problems

Similar Documents

Performing permutations on interconnection networks by regularly changing switch states

Reducing PE/memory traffic in multiprocessors by the difference coding of memory addresses

Circuit simulation algorithms on a distributed memory multiprocessor system

Extended hypercube: a hierarchical interconnection network of hypercubes

Synchronization and communication costs of loop partitioning on shared-memory multiprocessor systems

Products of networks with logarithmic diameter and fixed degree

Work-efficient routing algorithms for rearrangeable symmetrical networks

Optimal software multicast in wormhole-routed multistage networks

Cycle embedding in a faulty hypercube

Data locality exploitation in the decomposition of regular domain problems