Sciweavers

2924 search results - page 472 / 585
» Lower Bounds in Distributed Computing
Sort
View
EGPGV
2004
Springer
147views Visualization» more  EGPGV 2004»
15 years 10 months ago
I/O Strategies for Parallel Rendering of Large Time-Varying Volume Data
This paper presents I/O solutions for the visualization of time-varying volume data in a parallel and distributed computing environment. Depending on the number of rendering proce...
Hongfeng Yu, Kwan-Liu Ma, Joel Welling
NCA
2003
IEEE
15 years 9 months ago
Kernel-based Web switches providing content-aware routing
Locally distributed Web server systems represent a costeffective solution to the performance problems due to high traffic volumes reaching popular Web sites. In this paper, we fo...
Mauro Andreolini, Michele Colajanni, Marcello Nucc...
150
Voted
LCN
2002
IEEE
15 years 9 months ago
Parallel Packet Switching Using Multiplexors with Virtual Input Queues
Parallel Packet Switches (PPS) use internal, parallel switch planes that operate at less than line speed. A PPS can scale-up to faster line speeds than a single-plane switch can. ...
Ahmed Aslam, Kenneth J. Christensen
CONEXT
2007
ACM
15 years 8 months ago
Router buffer sizing revisited: the role of the output/input capacity ratio
The issue of router buffer sizing is still open and significant. Previous work either considers open-loop traffic or only analyzes persistent TCP flows. This paper differs in two ...
Ravi S. Prasad, Constantine Dovrolis, Marina Thott...
AINTEC
2006
Springer
15 years 8 months ago
A Topology-Aware Overlay Multicast Approach for Mobile Ad-Hoc Networks
AOMP (Ad-hoc Overlay Multicast Protocol) is a novel approach for application-layer multicast in ad-hoc networks. We introduce in this paper a new algorithm that exploits a few prop...
Mohamed Ali Kâafar, Cyrine Mrabet, Thierry T...