Sciweavers

175 search results - page 25 / 35
» Partially Ordered Runs: A Case Study
Sort
View
VLDB
1998
ACM
136views Database» more  VLDB 1998»
13 years 11 months ago
Materialized View Selection for Multidimensional Datasets
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton
ISSRE
2003
IEEE
14 years 20 days ago
Reducing wasted development time via continuous testing
Testing is often performed frequently during development to ensure software reliability by catching regression errors quickly. However, stopping frequently to test also wastes tim...
David Saff, Michael D. Ernst
ECRTS
2008
IEEE
14 years 1 months ago
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
Sibin Mohan, Johannes Helander
CONCUR
1998
Springer
13 years 11 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
14 years 28 days ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen