Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1995-1999  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Theory of computing systems 28 (1995), S. 1-11 
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper considers the problem of permutation packet routing on a √n×√n mesh-connected array of processors. Each node in the array is assumed to be independently faulty with a probability bounded above by a valuep. This paper gives a routing algorithm which, ifp⩽ 0.29, will with very high probability route every packet that can be routed inO(√n logn) steps with queue lengths that areO(log2 n). Extensions to higher-dimensional meshes are given.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...