Sciweavers

475 search results - page 78 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
ICSOC
2004
Springer
14 years 26 days ago
An OGSA-based accounting system for allocation enforcement across HPC centers
In this paper, we present an Open Grid Services Architecture (OGSA)-based decentralized allocation enforcement system, developed with an emphasis on a consistent data model and ea...
Thomas Sandholm, Peter Gardfjäll, Erik Elmrot...
BMCBI
2006
111views more  BMCBI 2006»
13 years 7 months ago
High throughput profile-profile based fold recognition for the entire human proteome
Background: In order to maintain the most comprehensive structural annotation databases we must carry out regular updates for each proteome using the latest profile-profile fold r...
Liam J. McGuffin, Richard T. Smith, Kevin Bryson, ...
INFOCOM
2007
IEEE
14 years 1 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
SPAA
2009
ACM
14 years 8 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
MIDDLEWARE
2004
Springer
14 years 26 days ago
Application partitioning and hierarchical management in grid environments
Several works on grid computing have been proposed in the last years. However, most of them, including available software, can not deal properly with some issues related to contro...
Patrícia Kayser Vargas, Inês de Castr...