Sciweavers

1075 search results - page 126 / 215
» Parallel Programming with Transactional Memory
Sort
View
LICS
1997
IEEE
15 years 6 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
223
Voted
SIGMOD
2007
ACM
224views Database» more  SIGMOD 2007»
16 years 2 months ago
Design of flash-based DBMS: an in-page logging approach
The popularity of high-density flash memory as data storage media has increased steadily for a wide spectrum of computing devices such as PDA's, MP3 players, mobile phones an...
Sang-Won Lee, Bongki Moon
128
Voted
CGO
2006
IEEE
15 years 8 months ago
Constructing Virtual Architectures on a Tiled Processor
As the amount of available silicon resources on one chip increases, we have seen the advent of ever increasing parallel resources integrated on-chip. Many architectures use these ...
David Wentzlaff, Anant Agarwal
174
Voted
PLILP
1998
Springer
15 years 6 months ago
Mobile Haskell: Compiling Lazy Functional Programs for the Java Virtual Machine
This paper shows how lazy functional programs can be made mobile by compiling them for the Java Virtual Machine. The Haskell compiler it describes is based on the h ,Gi-machine, wh...
David Wakeling
116
Voted
BIBM
2008
IEEE
110views Bioinformatics» more  BIBM 2008»
15 years 9 months ago
Genome Alignments Using MPI-LAGAN
We develop a parallel algorithm for a widely used whole genome alignment method called LAGAN. We use the MPI-based protocol to develop parallel solutions for two phases of the alg...
Ruinan Zhang, Huzefa Rangwala, George Karypis