Sciweavers

1502 search results - page 118 / 301
» Node weighted scheduling
Sort
View
CORR
2011
Springer
217views Education» more  CORR 2011»
14 years 10 months ago
Coarse-Grained Topology Estimation via Graph Sampling
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almq...
PPOPP
2006
ACM
16 years 7 days ago
Minimizing execution time in MPI programs on an energy-constrained, power-scalable cluster
Recently, the high-performance computing community has realized that power is a performance-limiting factor. One reason for this is that supercomputing centers have limited power ...
Robert Springer, David K. Lowenthal, Barry Rountre...
ICUMT
2009
15 years 4 months ago
Performance of relay-enabled uplink in cellular networks - a flow level analysis
Uplink users in cellular networks, such as UMTS/ HSPA, located at the edge of the cell generally suffer from poor channel conditions. Deploying intermediate relay nodes is seen as ...
Desislava C. Dimitrova, Hans van den Berg, Geert J...
INFOCOM
2009
IEEE
16 years 28 days ago
Graceful Network Operations
—A significant fraction of network events (such as topology or route changes) and the resulting performance degradation stem from premeditated network management and operational...
Saqib Raza, Yuanchen Zhu, Chen-Nee Chuah
ICCTA
2007
IEEE
16 years 15 days ago
Partially Dynamic Concurrent Update of Distributed Shortest Paths
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele ...