Sciweavers

47 search results - page 3 / 10
» Partitioning with terminals: a
Sort
View
DSN
2007
IEEE
15 years 3 months ago
Measuring Availability in Optimistic Partition-Tolerant Systems with Data Constraints
Replicated systems that run over partitionable environments, can exhibit increased availability if isolated partitions are allowed to optimistically continue their execution indep...
Mikael Asplund, Simin Nadjm-Tehrani, Stefan Beyer,...
PARELEC
2002
IEEE
15 years 2 months ago
Dynamic Process Partitioning and Migration for Irregular Applications
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
Pawel Czarnul
CORR
2011
Springer
268views Education» more  CORR 2011»
14 years 1 months ago
Approximation Algorithms for Submodular Multiway Partition
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
Chandra Chekuri, Alina Ene
ASPDAC
2000
ACM
117views Hardware» more  ASPDAC 2000»
15 years 1 months ago
Improved algorithms for hypergraph bipartitioning
Multilevel Fiduccia-Mattheyses MLFM hypergraph partitioning 3, 22, 24 is a fundamental optimization in VLSI CAD physical design. The leading implementation, hMetis 23 , has sinc...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...
P2P
2007
IEEE
113views Communications» more  P2P 2007»
15 years 3 months ago
Handling Network Partitions and Mergers in Structured Overlay Networks
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
Tallat M. Shafaat, Ali Ghodsi, Seif Haridi