232 search results - page 33 / 47 » On Characterizing the Data Access Complexity of Programs |
102
click to vote
PPOPP
2012
ACM
13 years 6 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
EUROPAR
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. To analyze the correctness and the performance of a program, information about the dynamic behavior of all participating processes is needed. The dynamic behavior can be ...
IPSN
2007
Springer
15 years 4 months ago
2007
Springer
The development of high-level programming environments is essential if wireless sensor networks are to be accessible to nonexperts. In this paper, we present the Regiment system, ...
145
Voted
IHI
2012
13 years 6 months ago
2012
Regulations and policies regarding Electronic Health Information (EHI) are increasingly complex. Federal and State policy makers have called for both education to increase stakeho...
OTM
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In this experience report, we present an evaluation of different techniques to manage concurrency in the context of application servers. Traditionally, using entity beans...