NDLI: Low expansion packings and embeddings of hypercubes into star graphs: a performance-oriented approach

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

Low expansion packings and embeddings of hypercubes into star graphs: a performance-oriented approach

Content Provider	IEEE Xplore Digital Library
Author	Moraes de Azevedo, M. Bagherzadeh, N. Latifi, S.
Copyright Year	1990
Abstract	We discuss the problem of packing hypercubes into an n-dimensional star graph S(n), which consists of embedding a disjoint union of hypercubes U into S(n) with load one. Hypercubes in U have from [n/2] to (n+1)/spl middot/[log/sub 2/ n]-2([lod/sub 2/n]+1)+2 dimensions, i.e., they can be as large as any hypercube which can be embedded with dilation at most four into S(n). We show that U can be embedded into S(n) with optimal expansion, which contrasts with the growing expansion ratios of previously known techniques. We employ several performance metrics to show that, with our techniques, a star graph can efficiently execute heterogeneous workloads containing hypercube, mesh, and star graph algorithms. The characterization of our packings includes some important metrics which have not been addressed by previous research (namely, average dilation, average congestion, and congestion). Our packings consistently produce small average congestion and average dilation, which indicates that the induced communication slowdown is also small. We consider several combinations of node mapping functions and routing algorithms in S(n), and obtain their corresponding performance metrics using either mathematical analysis or computer simulation.
Sponsorship	IEEE Computer Society
Starting Page	261
Ending Page	274
Page Count	14
File Size	597685
File Format	PDF
ISSN	10459219
Volume Number	9
Issue Number	3
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-03-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	Hypercubes Concurrent computing Multiprocessor interconnection networks Computer networks Embedded computing Measurement Routing Application software Pervasive computing Distributed computing
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

Embedding star networks into hypercubes

A comparative study of topological properties of hypercubes and star graphs

Constructing edge-disjoint spanning trees in product networks

Optimal parallel routing in star networks

Class-congruence property and two-phase routing of Borel Cayley graphs

Orthogonal graphs for the construction of a class of interconnection networks

An interconnection network for distributed recursive computations

Twisted Torus Topologies for Enhanced Interconnection Networks

A distributed management scheme for partitionable parallel computers

Low expansion packings and embeddings of hypercubes into star graphs: a performance-oriented approach

Similar Documents

Embedding star networks into hypercubes

A comparative study of topological properties of hypercubes and star graphs

Constructing edge-disjoint spanning trees in product networks

Optimal parallel routing in star networks

Class-congruence property and two-phase routing of Borel Cayley graphs

Orthogonal graphs for the construction of a class of interconnection networks

An interconnection network for distributed recursive computations

Twisted Torus Topologies for Enhanced Interconnection Networks

A distributed management scheme for partitionable parallel computers

Low expansion packings and embeddings of hypercubes into star graphs: a performance-oriented approach