Cart (Loading....) | Create Account
Close category search window

Solving fundamental problems on sparse-meshes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sibeyn, J.F. ; Max-Planck-Inst. fur Inf., Saarbrucken, Germany

A sparse-mesh, which has PUs on the diagonal of a two-dimensional grid only, is a cost effective distributed memory machine. Variants of this machine have been considered before, but none are as simple and pure as a sparse-mesh. Various fundamental problems (routing, sorting, list ranking) are analyzed, proving that sparse-meshes have great potential. It is shown that on a two-dimensional n×n sparse-mesh, which has n PUs, for h=ω(nε·log n), h-relations can be routed in (h+o(h))/ε steps. The results are extended for higher dimensional sparse-meshes. On a d-dimensional n x···x n sparse-mesh, with h=ω(nε ·log n), h-relations are routed in (6·(d-1)/ε-4)·(h+o(h)) steps

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:11 ,  Issue: 12 )

Date of Publication:

Dec 2000

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.