Sciweavers

2110 search results - page 44 / 422
» What is the complexity of a distributed computing system
Sort
View
STACS
2010
Springer
15 years 11 months ago
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
Edward A. Hirsch, Dmitry Itsykson
IFIP
1998
Springer
15 years 8 months ago
Java as a systems programming language: three case studies
Java is the newest in a long line of systems programming languages. This paper looks at what makes it special and backs the findings up with three case studies. The projects exerc...
Judy M. Bishop
CIE
2007
Springer
15 years 10 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
CCGRID
2009
IEEE
15 years 10 months ago
The Eucalyptus Open-Source Cloud-Computing System
Cloud computing systems fundamentally provide access to large pools of data and computational resources through a variety of interfaces similar in spirit to existing grid and HPC ...
Daniel Nurmi, Richard Wolski, Chris Grzegorczyk, G...
ICDCS
1990
IEEE
15 years 8 months ago
A Constructive Approach to the Design of Distributed Systems
The underlying model of distributed systems is that of loosely coupled components r running in parallel and communicating by message passing. Description, construction and evoluti...
Jeff Kramer, Jeff Magee, Anthony Finkelstein