This book is a significant study on automatic storage optimization. Specifically, the author looks at storage optimization in relation to several NP-complete problems, aiming to demonstrate both the plausibility and practicality of the technique. The author surveys past work on overlay heuristics and presents a family of heuristics that he has implemented in SOCRATES (the Storage Optimization Code Reorganization And Transformation Experimental System) to study the amenability of typical programs to various storage optimization techniques. The author finds that the problem of data overlay has a number of similarities to the Shipbuilding Problem and the Graph Coloring problem and demonstrates that, for array conflict graphs, a result by Alan Hoffman can be used to establish an upper bound for the extended chromatic number. Researchers with interests in compiler design, graph theory, and computer science will find much of interest in this book.
"synopsis" may belong to another edition of this title.
This product is not a traditionally bound book. Many ProQuest UMI products are black-and-white reproductions of original publications produced through the Books On Demand ® program. Alternately, this product may be a photocopy of a dissertation or it may be a collection reproduced on microfiche or microfilm if it is intended for library purchase.
"About this title" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book is a significant study on automatic storage optimization. Specifically, the author looks at storage optimization in relation to several NP-complete problems, aiming to demonstrate both the plausibility and practicality of the technique. The author surveys past work on overlay heuristics and presents a family of heuristics that he has implemented in SOCRATES (the Storage Optimization Code Reorganization And Transformation Experimental System) to study the amenability of typical programs to various storage optimization techniques. The author finds that the problem of data overlay has a number of similarities to the Shipbuilding Problem and the Graph Coloring problem and demonstrates that, for array conflict graphs, a result by Alan Hoffman can be used to establish an upper bound for the extended chromatic number. Researchers with interests in compiler design, graph theory, and computer science will find much of interest in this book. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781334016592_0
Quantity: Over 20 available
Seller: Bulrushed Books, Moscow, ID, U.S.A.
Condition: Like New. In unused condition, may show some slight shelf wear, but otherwise unread. This title was digitally scanned from a rare, out of print edition, and will have some visual artifacts from that process. Seller Inventory # #254F-0123
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334016592
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334016592
Quantity: 15 available