432 search results - page 60 / 87 » Internally deterministic parallel algorithms can be fast |
104
Voted
FSE
2008
Springer
15 years 3 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
141
Voted
BMCBI
2006
15 years 1 months ago
2006
Background: Stochastic simulation has become a useful tool to both study natural biological systems and design new synthetic ones. By capturing the intrinsic molecular fluctuation...
119
click to vote
ITCC
2005
IEEE
15 years 7 months ago
2005
IEEE
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
103
Voted
ISORC
2003
IEEE
15 years 7 months ago
2003
IEEE
Time triggered methods provide deterministic behaviour suitable for critical real-time systems. They perform less favourably, however, if the arrival times of some activities are ...
109
click to vote
SKG
2006
IEEE
15 years 7 months ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...