Sciweavers

2497 search results - page 8 / 500
» Requirements for models of achievable routing
Sort
View
PADS
2003
ACM
15 years 3 months ago
Reducing the Size of Routing Tables for Large-scale Network Simulation
In simulating large-scale networks, due to the limitation of available resources on computers, the size of the networks and the scale of simulation scenarios are often restricted....
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
JSW
2006
112views more  JSW 2006»
14 years 9 months ago
An Integrated Approach to Quality Achievement with Architectural Design Decisions
Good software architecture is critically important for successful software development. The software architecture can be defined as a set of architectural design decisions. However...
Heeseok Choi, Youhee Choi, Keunhyuk Yeom
ASPDAC
2005
ACM
94views Hardware» more  ASPDAC 2005»
14 years 11 months ago
Probabilistic congestion model considering shielding for crosstalk reduction
We extend an existing probabilistic congestion model to consider shielding for crosstalk reduction. We then develop a multilevel router to study the impact of various congestion m...
Jinjun Xiong, Lei He
SPAA
2004
ACM
15 years 3 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
SC
1993
ACM
15 years 1 months ago
Optimal fully adaptive wormhole routing for meshes
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of virtual channels required and in the number of restrictions placed on the use of t...
Loren Schwiebert, D. N. Jayasimha