NDLI: Simulation of meshes with separable buses by meshes with multiple partitioned buses

Content Provider	IEEE Xplore Digital Library
Author	Matsumae, S.
Copyright Year	2003
Description	Author affiliation: Dept. of Inf. Syst., Tottori Univ. of Environ. Studies, Japan (Matsumae, S.)
Abstract	This paper studies the simulation problem of meshes with separable buses (MSB) by meshes with multiple partitioned buses (MMPB). The MSB and the MMPB are the mesh connected computers enhanced by the addition of broadcasting buses along every row and column. The broadcasting buses of the MSB, called separable buses, can be dynamically sectioned into smaller bus segments by program control, while those of the MMPB, called partitioned buses, are statically partitioned in advance. In the MSB model, each row/column has only one separable bus, while in the MMPB model, each row/column has L partitioned buses (L /spl ges/ 2). We consider the simulation and the scaling-simulation of the MSB by the MMPB, and show that the MMPB of size n /spl times/ n can simulate the MSB of size n /spl times/ n in O(n/sup 1/(2L)/) steps, and that the MMPB of size m /spl times/ m can simulate the MSB of size n /spl times/ n in O(n/m(n/m+m/sup 1/(2L)/)) steps (m < n). The latter result implies that the MMPB of size m /spl times/ m can simulate the MSB of size n /spl times/ n time-optimally when m /spl les/ n/sup /spl alpha// holds for /spl alpha/ = 1/1+1/(2L).
Sponsorship	IEEE Comput. Soc Tech. Committee on Parallel Process. IEEE Comput. Soc. Tech. Committee on Comput. Archit. IEEE Comput. Soc. Tech. Committee on Distrib. Process. ACM SIGARCH
File Size	275693
File Format	PDF
ISBN	0769519261
ISSN	15302075
DOI	10.1109/IPDPS.2003.1213304
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2003-04-22
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Broadcasting Computational modeling Information systems Computer architecture Parallel processing Very large scale integration Upper bound
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

Optimal simulation of meshes with dynamically separable buses by meshes with statically partitioned buses

Parallel algorithms on a mesh with multiple broadcasting

Time-optimal proximity algorithms on meshes with multiple broadcasting

On the power of the mesh with hybrid buses

Square meshes are not always optimal

Time- and VLSI-optimal Sorting on Meshes with Multiple Broadcasting

An efficient scaling-simulation algorithm of reconfigurable meshes by meshes with partitioned buses

Time-optimal visibility-related algorithms of meshes with multiple broadcasting

A fast selection algorithm for meshes with multiple broadcasting

Simulation of meshes with separable buses by meshes with multiple partitioned buses

Similar Documents

Optimal simulation of meshes with dynamically separable buses by meshes with statically partitioned buses

Parallel algorithms on a mesh with multiple broadcasting

Time-optimal proximity algorithms on meshes with multiple broadcasting

On the power of the mesh with hybrid buses

Square meshes are not always optimal

Time- and VLSI-optimal Sorting on Meshes with Multiple Broadcasting

An efficient scaling-simulation algorithm of reconfigurable meshes by meshes with partitioned buses

Time-optimal visibility-related algorithms of meshes with multiple broadcasting

A fast selection algorithm for meshes with multiple broadcasting

Simulation of meshes with separable buses by meshes with multiple partitioned buses