A New Method to Automatically Compute Processing Times for Random Walks Based Distributed Algorithms

I
ISPDC
2003
Second International Symposium on Parallel and Distributed Computing
Abstract - A New Method to Automatically Compute Processing Times for Random Walks Based Distributed Algorithms

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Thibault Bernard Articles by Alain Bui Articles by Marc Bui Articles by Devan Sohier

Second International Symposium on Parallel and Distributed Computing

Ljubljana, Slovenia

October 13-October 14

ISBN: 0-7695-2069-3

	ASCII Text	x
	Thibault Bernard, Alain Bui, Marc Bui, Devan Sohier, "A New Method to Automatically Compute Processing Times for Random Walks Based Distributed Algorithms," Parallel and Distributed Computing, International Symposium on, pp. 31, Second International Symposium on Parallel and Distributed Computing, 2003.

	BibTex	x
	@article{ 10.1109/ISPDC.2003.1267640, author = {Thibault Bernard and Alain Bui and Marc Bui and Devan Sohier}, title = {A New Method to Automatically Compute Processing Times for Random Walks Based Distributed Algorithms}, journal ={Parallel and Distributed Computing, International Symposium on}, volume = {0}, year = {2003}, isbn = {0-7695-2069-3 }, pages = {31}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPDC.2003.1267640}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel and Distributed Computing, International Symposium on TI - A New Method to Automatically Compute Processing Times for Random Walks Based Distributed Algorithms SN - 0-7695-2069-3 SP EP A1 - Thibault Bernard, A1 - Alain Bui, A1 - Marc Bui, A1 - Devan Sohier, PY - 2003 KW - null VL - 0 JA - Parallel and Distributed Computing, International Symposium on ER -

Thibault Bernard, URCA, France

Alain Bui, URCA, France

Marc Bui, LRIA - EPHE, France

Devan Sohier, URCA, France; LRIA - EPHE, France

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPDC.2003.1267640

Random walks constitute an attractive technique in distributed computing. In this paper, we present an original method using relationship between electrical resistance and random walks, to automatically compute quantities such as cover time, and more generally any processing time measure defined through hitting times. This method comes from electrical theory by using Millman's theorem.

Citation:

Thibault Bernard, Alain Bui, Marc Bui, Devan Sohier, "A New Method to Automatically Compute Processing Times for Random Walks Based Distributed Algorithms," ispdc, pp.31, Second International Symposium on Parallel and Distributed Computing, 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.