Back to Results
First PageMeta Content
Routing algorithms / Network flow / Network theory / Shortest path problem / Routing / Maximum flow problem / Floyd–Warshall algorithm / Graph / Network topology / Graph theory / Mathematics / Theoretical computer science


System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson
Add to Reading List

Open Document

File Size: 134,32 KB

Share Result on Facebook

Company

National Semiconductor Corporation / /

Currency

USD / /

/

Facility

Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson Computer Science Division University of California at Berkeley Berkeley / Mathematics University of California at Berkeley Berkeley / /

IndustryTerm

area networks / multicomputer networks / actual network / actual algorithm / system-area network / them to all network / quiescent network / network mapping algorithm / bounded search depth / reasonable network / system area networks / local area networks / computing / parallel processors / traffic-free network / search depth / /

Organization

University of California / National Science Foundation / Department of Mathematics / /

Person

David Culler / Alan Mainwaring / Brent N. Chun / Schroeder / Saul Schleimer / N. Chun Saul Schleimer Daniel / Daniel S. Wilkerson / Alan M. Mainwaring Brent / /

/

Position

Professor / forward / head / /

ProgrammingLanguage

K / /

Technology

Ethernet / mapping algorithm / packet switching / The algorithm / network mapping algorithm / simulation / massively parallel processors / local area networks / client/server / packet-switched / actual algorithm / simplified algorithm / /

SocialTag