Log in to save to my catalogue

A Polynomial-Time Algorithm for Memory Space Reduction

A Polynomial-Time Algorithm for Memory Space Reduction

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_29923658

A Polynomial-Time Algorithm for Memory Space Reduction

About this item

Full title

A Polynomial-Time Algorithm for Memory Space Reduction

Publisher

New York: Springer Nature B.V

Journal title

International journal of parallel programming, 2005-02, Vol.33 (1), p.1-33

Language

English

Formats

Publication information

Publisher

New York: Springer Nature B.V

More information

Scope and Contents

Contents

Reducing memory space requirement is important to many applications. For data-intensive applications, it may help avoid executing the program out-of-core. For high-performance computing, memory space reduction may improve the cache hit rate as well as performance. For embedded systems, it can reduce the memory requirement, the memory latency and th...

Alternative Titles

Full title

A Polynomial-Time Algorithm for Memory Space Reduction

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_proquest_miscellaneous_29923658

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_29923658

Other Identifiers

ISSN

0885-7458

E-ISSN

1573-7640

DOI

10.1007/s10766-004-1459-8

How to access this item