AI SearchDistributed database design through partitioning optimizer
Call Number: AIT RSPR no. CS-89-7 Material type:
SeriesSeries: Asian Institute of Technology ; no. CS-89-7Publication details: Bangkok : Asian Institute of Technology, 1989Description: 58 pOnline resources: Dissertation note: Research Studies Project Report (M. Sc.) - Asian Institute of Technology, 1989 Summary: A partitioning optimizer, implemented Jn microcomputer-based Pascal, is developed using Taha's simplified version of the widely- us ed Balas' pure- binary integer programming method known as the Additive Algorithm, to optimize the allocation of databases, application programs, computers, and communication lines in a distributed infonnation system. The algo rithm is applied on a mathematical model which is formulated based on the constructed model of Chen and Akoka. The resulting model which is an integer nonlinear programming problem, is transformed to a pure- binary integer linear programming problem by the Polynomial Reduction Method introduced by Watters.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT RSPR no. CS-89-7 (Browse shelf(Opens below)) | 1 | Available | 30050003121497 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT RSPR no. CS-89-7 (Browse shelf(Opens below)) | 2 | Available | 30050003121489 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT RSPR no. CS-89-7 (Browse shelf(Opens below)) | Available | 30050120238836 |
A research study submitted ln partial fulfillment of the requirements for the degree of Master of Science, School of Engineering and Technology
Research Studies Project Report (M. Sc.) - Asian Institute of Technology, 1989
A partitioning optimizer, implemented Jn microcomputer-based Pascal, is developed using Taha's simplified version of the widely- us ed Balas' pure- binary integer programming method known as the Additive Algorithm, to optimize the allocation of databases, application programs, computers, and communication lines in a distributed infonnation system. The algo rithm is applied on a mathematical model which is formulated based on the constructed model of Chen and Akoka. The resulting model which is an integer nonlinear programming problem, is transformed to a pure- binary integer linear programming problem by the Polynomial Reduction Method introduced by Watters.
There are no comments on this title.