Sciweavers

551 search results - page 36 / 111
» An optimal migration algorithm for dynamic load balancing
Sort
View
SPAA
2004
ACM
15 years 5 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
JPDC
2007
177views more  JPDC 2007»
14 years 11 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
SIGCOMM
2010
ACM
15 years 2 days ago
SIP overload control: a backpressure-based approach
Overload happens in Session Initiation Protocol (SIP) networks when SIP servers have insufficient resources to handle all messages they receive. Under overload, SIP networks suffe...
Yaogong Wang
MONET
2006
170views more  MONET 2006»
14 years 11 months ago
Decentralized Utility-based Sensor Network Design
Wireless sensor networks consist of energy-constrained sensor nodes operating unattended in highly dynamic environments. In this paper, we advocate a systematic decentralized appro...
Narayanan Sadagopan, Mitali Singh, Bhaskar Krishna...
IPPS
1999
IEEE
15 years 4 months ago
Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
Hettihe P. Dharmasena, Ramachandran Vaidyanathan