Sciweavers

2190 search results - page 407 / 438
» Distributed algorithms for dynamic coverage in sensor networ...
Sort
View
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
14 years 9 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
SIGMETRICS
2004
ACM
105views Hardware» more  SIGMETRICS 2004»
14 years 2 months ago
A model of BGP routing for network engineering
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of th...
Nick Feamster, Jared Winick, Jennifer Rexford
CLUSTER
2008
IEEE
14 years 3 months ago
Exploiting data compression in collective I/O techniques
This paper presents Two-Phase Compressed I/O (TPC I/O,) an optimization of the Two-Phase collective I/O technique from ROMIO, the most popular MPI-IO implementation. In order to r...
Rosa Filgueira, David E. Singh, Juan Carlos Pichel...
JVA
2006
IEEE
14 years 2 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
DEXAW
2005
IEEE
356views Database» more  DEXAW 2005»
14 years 2 months ago
Grid Visualizer: A Monitoring Tool for Grid Environment
One specific problem in wide-area distributed computing environment is effective management of the vast amount of resources that are made available within the grid environment. Th...
Ghazala Shaheen, Muhammad Usman Malik, Zohair Ihsa...