Sciweavers

1686 search results - page 218 / 338
» Programs as polygraphs: computability and complexity
Sort
View
DSN
2005
IEEE
15 years 9 months ago
Effective Testing and Debugging Techniques for a Group Communication System
View-oriented group communication is an important and widely used building block for constructing highlyavailable fault-tolerant systems. Unfortunately, groupcommunication based s...
Eitan Farchi, Gabriel Kliot, Yoel Krasny, Alex Kri...
IMR
2005
Springer
15 years 9 months ago
Design and Implementation of a Corporate Mesh Object
Today, finite element technologies allow engineers to analyze complex assemblies and subsystems. With CPU power constantly increasing, it is not unreasonable to state that the eng...
John Svitek, Wa Kwok, Joseph R. Tristano
137
Voted
ICPP
1999
IEEE
15 years 8 months ago
Improving Performance of Load-Store Sequences for Transaction Processing Workloads on Multiprocessors
On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the databas...
Jim Nilsson, Fredrik Dahlgren
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 8 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
DAGSTUHL
2004
15 years 5 months ago
Simplicity Considered Fundamental to Design for Predictability
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
Wolfgang A. Halang