Sciweavers

118 search results - page 15 / 24
» Fast distributed graph partition and application
Sort
View
FAST
2009
13 years 5 months ago
BORG: Block-reORGanization for Self-optimizing Storage Systems
This paper presents the design, implementation, and evaluation of BORG, a self-optimizing storage system that performs automatic block reorganization based on the observed I/O wor...
Medha Bhadkamkar, Jorge Guerra, Luis Useche, Sam B...
FAST
2009
13 years 5 months ago
Minuet: Rethinking Concurrency Control in Storage Area Networks
Clustered applications in storage area networks (SANs), widely adopted in enterprise datacenters, have traditionally relied on distributed locking protocols to coordinate concurre...
Andrey Ermolinskiy, Daekyeong Moon, Byung-Gon Chun...
AAAI
2010
13 years 9 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...
HPDC
2010
IEEE
13 years 8 months ago
Detouring and replication for fast and reliable internet-scale stream processing
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
Christopher McConnell, Fan Ping, Jeong-Hyon Hwang
SIGADA
1999
Springer
13 years 11 months ago
Redistribution in distributed Ada
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
Scott James