Sciweavers

5588 search results - page 898 / 1118
» Parallel Implementation of Bags
Sort
View
OOPSLA
2005
Springer
15 years 9 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
140
Voted
ICPP
2002
IEEE
15 years 8 months ago
Software Caching using Dynamic Binary Rewriting for Embedded Devices
A software cache implements instruction and data caching entirely in software. Dynamic binary rewriting offers a means to specialize the software cache miss checks at cache miss t...
Chad Huneycutt, Joshua B. Fryman, Kenneth M. Macke...
136
Voted
VLDB
1987
ACM
78views Database» more  VLDB 1987»
15 years 6 months ago
Measured Performance of Time Interval Concurrency Control Techniques
This paper reports on an implementation of Bayer's Time Interval concurrency control method and compares it to the performance of a conventional timestamp method. The impleme...
Jerre D. Noe, David B. Wagner
166
Voted
BMCBI
2008
214views more  BMCBI 2008»
15 years 3 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
131
Voted
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
15 years 3 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen