Sciweavers

613 search results - page 101 / 123
» Fault Tolerant Data Structures
Sort
View
ISCA
2011
IEEE
238views Hardware» more  ISCA 2011»
14 years 1 months ago
Rebound: scalable checkpointing for coherent shared memory
As we move to large manycores, the hardware-based global checkpointing schemes that have been proposed for small shared-memory machines do not scale. Scalability barriers include ...
Rishi Agarwal, Pranav Garg, Josep Torrellas
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
15 years 9 months ago
Relational-style XML query
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
Taro L. Saito, Shinichi Morishita
81
Voted
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
15 years 4 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
CODES
2007
IEEE
15 years 4 months ago
Reliable multiprocessor system-on-chip synthesis
This article presents a multiprocessor system-on-chip synthesis (MPSoC) algorithm that optimizes system mean time to failure. Given a set of directed acyclic periodic graphs of co...
Changyun Zhu, Zhenyu (Peter) Gu, Robert P. Dick, L...
SRDS
2006
IEEE
15 years 3 months ago
MOve: Design of An Application-Malleable Overlay
Peer-to-peer overlays allow distributed applications to work in a wide-area, scalable, and fault-tolerant manner. However, most structured and unstructured overlays present in lit...
Sébastien Monnet, Ramsés Morales, Ga...