Sciweavers

12301 search results - page 366 / 2461
» Distributed Computation in Dynamic Networks
Sort
View
HIPC
2003
Springer
15 years 12 months ago
Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks
This paper shows that an n = 2k processor Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can simulate either a mono-directional move of a...
Alessandro Mei, Romeo Rizzi
AIMS
2009
Springer
16 years 1 months ago
Visualization of Node Interaction Dynamics in Network Traces
The analysis of network traces often requires to find the spots where something interesting happens. Since traces are usually very large data-sets, it is often not easy and time i...
Petar Dobrev, Sorin Stancu-Mara, Jürgen Sch&o...
ICAC
2006
IEEE
16 years 25 days ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
196
Voted
ICPADS
2006
IEEE
16 years 24 days ago
Memory and Network Bandwidth Aware Scheduling of Multiprogrammed Workloads on Clusters of SMPs
Symmetric Multiprocessors (SMPs), combined with modern interconnection technologies are commonly used to build cost-effective compute clusters. However, contention among processor...
Evangelos Koukis, Nectarios Koziris
ICASSP
2009
IEEE
16 years 1 months ago
Distributed peer-to-peer beamforming for multiuser relay networks
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state information is assumed to be known at the relays or de...
Haihua Chen, Alex B. Gershman, Shahram Shahbazpana...