Sciweavers

574 search results - page 38 / 115
» Spatio-temporal memory streaming
Sort
View
SEFM
2008
IEEE
14 years 2 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
IEEEPACT
2005
IEEE
14 years 1 months ago
Memory State Compressors for Giga-Scale Checkpoint/Restore
We propose a checkpoint store compression method for coarse-grain giga-scale checkpoint/restore. This mechanism can be useful for debugging, post-mortem analysis and error recover...
Andreas Moshovos, Alexandros Kostopoulos
IMECS
2007
13 years 9 months ago
A Hybrid Markov Model for Accurate Memory Reference Generation
—Workload characterisation and generation is becoming an increasingly important area as hardware and application complexities continue to advance. In this paper, we introduce a c...
Rahman Hassan, Antony Harris
PODS
2003
ACM
143views Database» more  PODS 2003»
14 years 7 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
ISCI
2006
58views more  ISCI 2006»
13 years 7 months ago
Streaming data reduction using low-memory factored representations
Many special purpose algorithms exist for extracting information from streaming data. Constraints are imposed on the total memory and on the average processing time per data item....
David Littau, Daniel Boley