Sciweavers

168 search results - page 2 / 34
» Making Applications Persistent at Run-time
Sort
View
CCGRID
2006
IEEE
13 years 10 months ago
Statistical Properties of Task Running Times in a Global-Scale Grid Environment
— Over the years, the use of global grid environments have become widespread. In order to make applications robust against the dynamics of those grid environments it is essential...
Menno Dobber, Robert D. van der Mei, Ger Koole
ASPLOS
1996
ACM
13 years 8 months ago
An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
Sandhya Dwarkadas, Alan L. Cox, Willy Zwaenepoel
OSDI
1996
ACM
13 years 5 months ago
Safe Kernel Extensions Without Run-Time Checking
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
George C. Necula, Peter Lee
ICDE
2007
IEEE
103views Database» more  ICDE 2007»
14 years 5 months ago
Making Applications Persistent at Run-time
Persistence is a common requirement in many applications. In existing systems, persistence is added to an application at either compile or deployment time by using a variety of me...
Angela Nicoara, Gustavo Alonso
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
13 years 8 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig