Sciweavers

4541 search results - page 685 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
SIGADA
2005
Springer
16 years 17 days ago
Experiences using SPARK in an undergraduate CS course
This paper describes experiences garnered while teaching a course on high integrity software using SPARK to a mix of junior and senior level undergraduates. The paper describes th...
Anthony S. Ruocco
FSTTCS
2004
Springer
16 years 15 days ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
PVM
2004
Springer
16 years 13 days ago
A Refinement Strategy for a User-Oriented Performance Analysis
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
Jan Lemeire, Andy Crijns, John Crijns, Erik F. Dir...
WWW
2010
ACM
16 years 12 days ago
Keyword search over key-value stores
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
Arash Termehchy, Marianne Winslett
IPPS
2003
IEEE
16 years 11 days ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner