Sciweavers

378 search results - page 27 / 76
» Analytical Modeling of Pipeline Parallelism
Sort
View
IPPS
2007
IEEE
15 years 3 months ago
Performance Modelling of Peer-to-Peer Routing
We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well a...
Idris A. Rai, Andrew Brampton, Andrew MacQuire, La...
CSE
2011
IEEE
13 years 9 months ago
Performance Enhancement of Network Devices with Multi-Core Processors
— In network based applications, packet capture is the main area that attracts many researchers in developing traffic monitoring systems. Along with the packet capture, many othe...
Nhat-Phuong Tran, Sugwon Hong, Myungho Lee, Seung-...
IPPS
1999
IEEE
15 years 1 months ago
Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus...
Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Va...
WOSP
1998
ACM
15 years 1 months ago
Poems: end-to-end performance design of large parallel adaptive computational systems
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
Ewa Deelman, Aditya Dube, Adolfy Hoisie, Yong Luo,...
ICPADS
2007
IEEE
15 years 3 months ago
On the relative value of local scheduling versus routing in parallel server systems
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
Rong Wu, Douglas G. Down