Sciweavers

7092 search results - page 1219 / 1419
» Parallelizing constraint programs
Sort
View
CLUSTER
2001
IEEE
13 years 12 months ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi
DEBS
2008
ACM
13 years 10 months ago
Replica placement for high availability in distributed stream processing systems
A significant number of emerging on-line data analysis applications require the processing of data streams, large amounts of data that get updated continuously, to generate output...
Thomas Repantis, Vana Kalogeraki
SPAA
2010
ACM
13 years 8 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
GRID
2007
Springer
13 years 8 months ago
Managing Role-Based Access Control Policies for Grid Databases in OGSA-DAI Using CAS
In this paper, we present a role-based access control method for accessing databases through the Open Grid Services Architecture – Data Access and Integration (OGSA-DAI) framewor...
Anil L. Pereira, Vineela Muppavarapu, Soon M. Chun...
IPPS
2010
IEEE
13 years 6 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
« Prev « First page 1219 / 1419 Last » Next »