Sciweavers

3116 search results - page 546 / 624
» Design and implementation of network puzzles
Sort
View
SOSP
2005
ACM
16 years 1 months ago
Fault-scalable Byzantine fault-tolerant services
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...
Michael Abd-El-Malek, Gregory R. Ganger, Garth R. ...
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
16 years 1 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich
ACSAC
2009
IEEE
15 years 11 months ago
Analyzing and Detecting Malicious Flash Advertisements
—The amount of dynamic content on the web has been steadily increasing. Scripting languages such as JavaScript and browser extensions such as Adobe’s Flash have been instrument...
Sean Ford, Marco Cova, Christopher Kruegel, Giovan...
ICDCS
2009
IEEE
15 years 11 months ago
Explicit Batching for Distributed Objects
Although distributed object systems, for example RMI and CORBA, enable object-oriented programs to be easily distributed across a network, achieving acceptable performance usually...
Eli Tilevich, William R. Cook, Yang Jiao
CCGRID
2009
IEEE
15 years 11 months ago
C-Meter: A Framework for Performance Analysis of Computing Clouds
—Cloud computing has emerged as a new technology that provides large amount of computing and data storage capacity to its users with a promise of increased scalability, high avai...
Nezih Yigitbasi, Alexandru Iosup, Dick H. J. Epema...