Sciweavers

1794 search results - page 99 / 359
» Visualizing Memory Graphs
Sort
View
EUROPAR
1998
Springer
15 years 8 months ago
Analysing an SQL Application with a BSPlib Call-Graph Profiling Tool
This paper illustrates the use of a post-mortem call-graph profiling tool in the analysis of an SQL query processing application written using BSPIib [4]. Unlike other parallel pro...
Jonathan M. D. Hill, Stephen A. Jarvis, Constantin...
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 9 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
ISSS
1999
IEEE
149views Hardware» more  ISSS 1999»
15 years 8 months ago
A Buffer Merging Technique for Reducing Memory Requirements of Synchronous Dataflow Specifications
Synchronous Dataflow, a subset of dataflow, has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem duri...
Praveen K. Murthy, Shuvra S. Bhattacharyya
CONNECTION
2006
101views more  CONNECTION 2006»
15 years 4 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
POS
2000
Springer
15 years 7 months ago
The Memory Behavior of the WWW, or The WWW Considered as a Persistent Store
Abstract. This paper presents the performance evaluation of five memory allocation strategies for the PerDiS Persistent Distributed Object store in the context of allocating two di...
Nicolas Richer, Marc Shapiro