Sciweavers

1594 search results - page 56 / 319
» Visualizing Program Executions on Large Data Sets
Sort
View
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 2 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
150
Voted
TACAS
2010
Springer
221views Algorithms» more  TACAS 2010»
15 years 9 months ago
Trace-Based Symbolic Analysis for Atomicity Violations
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
Chao Wang, Rhishikesh Limaye, Malay K. Ganai, Aart...
LCTRTS
2000
Springer
15 years 5 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
INFOVIS
2002
IEEE
15 years 6 months ago
A Hybrid Layout Algorithm for Sub-Quadratic Multidimensional Scaling
Many clustering and layout techniques have been used for structuring and visualising complex data. This paper is inspired by a number of such contemporary techniques and presents ...
Alistair Morrison, Greg Ross, Matthew Chalmers
DAGSTUHL
2003
15 years 3 months ago
Feature tracking with skeleton graphs
One way to visualize large time-dependent data sets, is by visualization of the evolution of features in these data. The process consists of four steps: feature extraction, featur...
Benjamin Vrolijk, Freek Reinders, Frits H. Post