Sciweavers

2066 search results - page 261 / 414
» Component-Based Programming of Distributed Applications
Sort
View
IEEEPACT
2006
IEEE
15 years 7 months ago
Whole-program optimization of global variable layout
On machines with high-performance processors, the memory system continues to be a performance bottleneck. Compilers insert prefetch operations and reorder data accesses to improve...
Nathaniel McIntosh, Sandya Mannarswamy, Robert Hun...
ICALP
2001
Springer
15 years 5 months ago
Secure Games with Polynomial Expressions
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
Aggelos Kiayias, Moti Yung
104
Voted
SIGCSE
2009
ACM
193views Education» more  SIGCSE 2009»
16 years 1 months ago
Seattle: a platform for educational cloud computing
Cloud computing is rapidly increasing in popularity. Companies such as RedHat, Microsoft, Amazon, Google, and IBM are increasingly funding cloud computing infrastructure and resea...
Justin Cappos, Ivan Beschastnikh, Arvind Krishnamu...
OOPSLA
2007
Springer
15 years 7 months ago
Scalable omniscient debugging
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
Guillaume Pothier, Éric Tanter, José...
154
Voted
HPCA
1996
IEEE
15 years 5 months ago
A Comparison of Entry Consistency and Lazy Release Consistency Implementations
This paper compares several implementations of entry consistency (EC) and lazy release consistency (LRC), two relaxed memory models in use with software distributed shared memory ...
Sarita V. Adve, Alan L. Cox, Sandhya Dwarkadas, Ra...