Sciweavers

968 search results - page 28 / 194
» A faster implementation of APlace
Sort
View
ERLANG
2003
ACM
14 years 3 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
LSSC
2001
Springer
14 years 2 months ago
Parallel Implementation of a Large-Scale 3-D Air Pollution Model
Abstract. Air pollution models can efficiently be used in different environmental studies. The atmosphere is the most dynamic component of the environment, where the pollutants ca...
Tzvetan Ostromsky, Zahari Zlatev
MEMOCODE
2008
IEEE
14 years 4 months ago
High-throughput Pipelined Mergesort
Abstract: We present an implementation of a highthroughput cryptosorter, capable of sorting an encrypted database of eight megabytes in .15 seconds; 1102 times faster than a softwa...
Kermin Fleming, Myron King, Man Cheuk Ng, Asif Kha...
FPL
2009
Springer
105views Hardware» more  FPL 2009»
14 years 2 months ago
Towards a viable out-of-order soft core: Copy-Free, checkpointed register renaming
As a step torward a viable, single-issue out-of-order soft core, this work presents Copy-Free Checkpointing (CFC), an FPGA-friendly register renaming design. CFC supports speculat...
Kaveh Aasaraai, Andreas Moshovos
SCHOLARPEDIA
2011
13 years 18 days ago
N-body simulations
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...