Dynamic memory management in the loci framework

Authors:
Yang Zhang;Edward A. Luke
Affiliations:
Department of Computer Science and Engineering, Mississippi State University, Mississippi State, MS;Department of Computer Science and Engineering, Mississippi State University, Mississippi State, MS
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Year:
2005

Citing 7
Cited 1

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
A bridging model for parallel computation

Communications of the ACM
A region inference algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Uniprocessor Garbage Collection Techniques

IWMM '92 Proceedings of the International Workshop on Memory Management
Loci: A Deductive Framework for Graph-Based Algorithms

ISCOPE '99 Proceedings of the Third International Symposium on Computing in Object-Oriented Parallel Environments
Chain: operator scheduling for memory minimization in data stream systems

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Loci: a rule-based framework for parallel multi-disciplinary simulation synthesis

Journal of Functional Programming

Supporting scalable Bayesian networks using configurable discretizer actuators

ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Resource management is a critical concern in high-performance computing software. While management of processing resources to increase performance is the most critical, efficient management of memory resources plays an important role in solving large problems. This paper presents a dynamic memory management scheme for a declarative high-performance data-parallel programming system — the Loci framework. In such systems, some sort of automatic resource management is a requirement. We present an automatic memory management scheme that provides good compromise between memory utilization and speed. In addition to basic memory management, we also develop methods that take advantages of the cache memory subsystem and explore balances between memory utilization and parallel communication costs.