Sciweavers

9325 search results - page 1576 / 1865
» The decentralized implementability problem
Sort
View
SAC
2010
ACM
15 years 11 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
131
Voted
PLDI
2009
ACM
15 years 11 months ago
Dynamic software updates: a VM-centric approach
Software evolves to fix bugs and add features. Stopping and restarting programs to apply changes is inconvenient and often costly. Dynamic software updating (DSU) addresses this ...
Suriya Subramanian, Michael W. Hicks, Kathryn S. M...
145
Voted
POPL
2009
ACM
15 years 11 months ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...
EDBT
2009
ACM
186views Database» more  EDBT 2009»
15 years 11 months ago
Automating the loading of business process data warehouses
Business processes drive the operations of an enterprise. In the past, the focus was primarily on business process design, modeling, and automation. Recently, enterprises have rea...
Malú Castellanos, Alkis Simitsis, Kevin Wil...
143
Voted
LCTRTS
2009
Springer
15 years 11 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr
« Prev « First page 1576 / 1865 Last » Next »