234 search results - page 22 / 47 » Lightweight Task Graph Inference for Distributed Application... |
124
click to vote
CCGRID
2008
IEEE
15 years 1 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
103
click to vote
SERA
2010
Springer
14 years 10 months ago
2010
Springer
Abstract—With the growing complexity of software applications, there is an increasing demand for solutions to distribute workload into server pools. Grid Computing provides power...
114
click to vote
SACMAT
2006
ACM
15 years 5 months ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
121
click to vote
CLUSTER
2010
IEEE
14 years 3 months ago
2010
IEEE
Many-task computing aims to bridge the gap between two computing paradigms, high throughput computing and high performance computing. Many-task computing denotes highperformance co...
TIT
2008
14 years 11 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...