Sciweavers

1170 search results - page 51 / 234
» How Fast Is Too Fast
Sort
View
109
Voted
DSN
2009
IEEE
15 years 9 months ago
Fast memory state synchronization for virtualization-based fault tolerance
Virtualization provides the possibility of whole machine migration and thus enables a new form of fault tolerance that is completely transparent to applications and operating syst...
Maohua Lu, Tzi-cker Chiueh
113
Voted
ISVC
2009
Springer
15 years 9 months ago
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
Given a Cylindrical Algebraic Decomposition of an implicit algebraic curve, visualizing distinct curve arcs is not as easy as it stands because, despite the absence of singularitie...
Pavel Emeliyanenko, Eric Berberich, Michael Sagral...
125
Voted
SIGCOMM
2009
ACM
15 years 9 months ago
Building a fast, virtualized data plane with programmable hardware
Network virtualization allows many networks to share the same underlying physical topology; this technology has offered promise both for experimentation and for hosting multiple n...
Muhammad Bilal Anwer, Nick Feamster
DASFAA
2007
IEEE
183views Database» more  DASFAA 2007»
15 years 9 months ago
BioDIFF: An Effective Fast Change Detection Algorithm for Biological Annotations
Abstract. Warehousing heterogeneous, dynamic biological data is a key technique for biological data integration as it greatly improves performance. However, it requires complex mai...
Yang Song, Sourav S. Bhowmick, C. Forbes Dewey
124
Voted
IPPS
2007
IEEE
15 years 9 months ago
Memory Optimizations For Fast Power-Aware Sparse Computations
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
Konrad Malkowski, Padma Raghavan, Mary Jane Irwin