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

Multithreading implementation of a distributed shortest path algorithm on EARTH multiprocessor

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

3 Author(s)
Thulasiraman, P. ; Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada ; Xin-Min Tian ; Gao, G.R.

Network optimization refers to those optimization problems defined on weighted graphs. In general, the shortest path and max-flow problems have served as critical building blocks in formulating solutions to more complex network optimization problems. In this paper, as the first step in studying and evaluating implementations of network optimization problems on multithreaded multiprocessors, we present a multithreaded implementation of a distributed shortest path algorithm proposed by K.M. Chandy and J. Misra (1982) on the EARTH-MANNA multithreaded architecture, and discuss performance results on the ERTH-MANNA system

Published in:

High Performance Computing, 1996. Proceedings. 3rd International Conference on

Date of Conference:

19-22 Dec 1996

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.