Sciweavers

4037 search results - page 635 / 808
» Routing without ordering
Sort
View
EUROSYS
2006
ACM
16 years 1 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
PEPM
2010
ACM
16 years 1 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
FASE
2010
Springer
15 years 11 months ago
A Lightweight and Portable Approach to Making Concurrent Failures Reproducible
Multithreaded concurrent programs often exhibit bugs due to unintended interferences among the concurrent threads. Such bugs are often hard to reproduce because they typically hap...
Qingzhou Luo, Sai Zhang, Jianjun Zhao, Min Hu
SENSYS
2009
ACM
15 years 11 months ago
Macrodebugging: global views of distributed program execution
Creating and debugging programs for wireless embedded networks (WENs) is notoriously difficult. Macroprogramming is an emerging technology that aims to address this by providing ...
Tamim I. Sookoor, Timothy W. Hnat, Pieter Hooimeij...
FC
2009
Springer
134views Cryptology» more  FC 2009»
15 years 11 months ago
Cryptographic Combinatorial Securities Exchanges
Abstract. We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information ...
Christopher Thorpe, David C. Parkes