Sciweavers

287 search results - page 14 / 58
» Introducing parallelism and concurrency in the data structur...
Sort
View
VLDB
1998
ACM
134views Database» more  VLDB 1998»
13 years 11 months ago
Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method
Numerous applications such as stock market or medical information systems require that both historical and current data be logically integrated into a temporal database. The under...
Peter Muth, Patrick E. O'Neil, Achim Pick, Gerhard...
WDAG
2010
Springer
182views Algorithms» more  WDAG 2010»
13 years 5 months ago
Scalable Flat-Combining Based Synchronous Queues
In a synchronous queue, producers and consumers handshake to exchange data. Recently, new scalable unfair synchronous queues were added to the Java JDK 6.0 to support high performa...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...
AMAST
2006
Springer
13 years 11 months ago
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...
Susumu Nishimura
CCGRID
2004
IEEE
13 years 11 months ago
Evolutionary molecular structure determination using Grid-enabled data mining
A new computational framework is developed for the evolutionary determination of molecular crystal structures using the Shake-and-Bake methodology. Genetic algorithms are performe...
Mark L. Green, Russ Miller
JPDC
2006
111views more  JPDC 2006»
13 years 7 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader