4386 search results - page 803 / 878 » A Tamper-Resistant Programming Language System |
134
click to vote
ICALP
1997
Springer
15 years 5 months ago
1997
Springer
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
115
click to vote
ASPLOS
1992
ACM
15 years 5 months ago
1992
ACM
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
111
click to vote
ICALP
1992
Springer
15 years 5 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
138
click to vote
ASPLOS
2008
ACM
15 years 3 months ago
2008
ACM
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
116
click to vote
ASPLOS
2006
ACM
15 years 3 months ago
2006
ACM
Different uses of memory protection schemes have different needs in terms of granularity. For example, heap security can benefit from chunk separation (by using protected "pa...