Sciweavers

627 search results - page 90 / 126
» How optimal is the genetic code
Sort
View
133
Voted
PLDI
2006
ACM
15 years 9 months ago
Optimizing memory transactions
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
Timothy L. Harris, Mark Plesko, Avraham Shinnar, D...
SIGIR
2012
ACM
13 years 6 months ago
Optimizing positional index structures for versioned document collections
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
Jinru He, Torsten Suel
124
Voted
ISAAC
2009
Springer
114views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Good Programming in Transactional Memory
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
Raphael Eidenbenz, Roger Wattenhofer
135
Voted
IPPS
2007
IEEE
15 years 9 months ago
Linking Compilation and Visualization for Massively Parallel Programs
This paper presents a technique to visualize the communication pattern of a parallel application at different points during its execution. Unlike many existing tools that show the...
Alex K. Jones, Raymond R. Hoare, Joseph St. Onge, ...
123
Voted
IESS
2007
Springer
162views Hardware» more  IESS 2007»
15 years 9 months ago
Automatic Parallelization of Sequential Specifications for Symmetric MPSoCs
Abstract This paper presents an embedded system design toolchain for automatic generation of parallel code runnable on symmetric multiprocessor systems from an initial sequential s...
Fabrizio Ferrandi, Luca Fossati, Marco Lattuada, G...