Sciweavers

3497 search results - page 673 / 700
» Making Distributed Applications Robust
Sort
View
ASYNC
2002
IEEE
124views Hardware» more  ASYNC 2002»
15 years 4 months ago
Synchronous Interlocked Pipelines
In a circuit environment that is becoming increasingly sensitive to dynamic power dissipation and noise, and where cycle time available for control decisions continues to decrease...
Hans M. Jacobson, Prabhakar Kudva, Pradip Bose, Pe...
ICDT
2010
ACM
205views Database» more  ICDT 2010»
15 years 4 months ago
On the Aggregation Problem for Synthesized Web Services
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu
97
Voted
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 4 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
SYSTOR
2010
ACM
15 years 4 months ago
On the DMA mapping problem in direct device assignment
I/O intensive workloads running in virtual machines can suffer massive performance degradation. Direct assignment of I/O devices to virtual machines is the best performing I/O vir...
Ben-Ami Yassour, Muli Ben-Yehuda, Orit Wasserman
ICSE
2010
IEEE-ACM
15 years 4 months ago
Adaptive bug isolation
Statistical debugging uses lightweight instrumentation and statistical models to identify program behaviors that are strongly predictive of failure. However, most software is most...
Piramanayagam Arumuga Nainar, Ben Liblit