{"@context":"http://iiif.io/api/presentation/2/context.json","@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/manifest.json","@type":"sc:Manifest","label":"On the optimization of Grid Systems","metadata":[{"label":"dc.description.sponsorship","value":"This work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree."},{"label":"dc.format","value":"Monograph"},{"label":"dc.format.medium","value":"Electronic Resource"},{"label":"dc.identifier.uri","value":"http://hdl.handle.net/11401/77491"},{"label":"dc.language.iso","value":"en_US"},{"label":"dc.publisher","value":"The Graduate School, Stony Brook University: Stony Brook, NY."},{"label":"dcterms.abstract","value":"Grid systems are widely used to transfer power and information in various forms in many engineering and scientific areas such as grid computing systems, electrical grids, control grid and etc. A good handling of task partition, task allocation and load balancing can significantly increase a grid systems' efficiency. In this dissertation, balancing the loads in electrical grid systems and optimizing grid computing systems are analyzed. Unbalanced loads on feeders increase power system investment and operating costs. Three-phase lateral loads phase swapping is one of the popular methods to balance such systems. We employed a dynamic programming algorithm that makes optimal suggestions to balance the load in electrical grid systems given an input of previous years' data. The algorithm is compared with exhaustive search, the greedy algorithm and heuristic algorithms and it excels in terms of optimality and running time. Based on this, a more general load balancing algorithm with spatial consideration for electrical grid is developed. For the grid computing systems, an interesting class of research topics is the optimal task partition and their mapping to different distributed computing machines with communication time that is nonlinear to the size of the transferring files. Grid computing systems are essentially distributed computing systems without workload dependencies on different machines and with internal communications. Thus, Divisible Load Theory (DLT) is a good match to the scheduling problems in grid computing systems. We developed a DLT-based method to optimally partition the computing load into fractions and map them to computing machines with nonlinear communication speed in the size of loads. Furthermore, two novel performance measurements for grid computing systems with multi-level tree networks are examined. One measure is utilization: the fraction of time processors are busy processing computational load. The other is progress: the percentage of load processed so far at a given time. A variety of scheduling policies are considered."},{"label":"dcterms.available","value":"2017-09-20T16:52:48Z"},{"label":"dcterms.contributor","value":"Robertazzi, Thomas G."},{"label":"dcterms.creator","value":"Wang, Kai"},{"label":"dcterms.dateAccepted","value":"2017-09-20T16:52:48Z"},{"label":"dcterms.dateSubmitted","value":"2017-09-20T16:52:48Z"},{"label":"dcterms.description","value":"Department of Electrical Engineering."},{"label":"dcterms.extent","value":"143 pg."},{"label":"dcterms.format","value":"Application/PDF"},{"label":"dcterms.identifier","value":"http://hdl.handle.net/11401/77491"},{"label":"dcterms.issued","value":"2013-12-01"},{"label":"dcterms.language","value":"en_US"},{"label":"dcterms.provenance","value":"Made available in DSpace on 2017-09-20T16:52:48Z (GMT). No. of bitstreams: 1\nWang_grad.sunysb_0771E_11632.pdf: 2109994 bytes, checksum: 423eeeaea3a009596bf559cb46fc22c2 (MD5)\n  Previous issue date:    1"},{"label":"dcterms.publisher","value":"The Graduate School, Stony Brook University: Stony Brook, NY."},{"label":"dcterms.subject","value":"Electrical engineering"},{"label":"dcterms.title","value":"On the optimization of Grid Systems"},{"label":"dcterms.type","value":"Dissertation"},{"label":"dc.type","value":"Dissertation"}],"description":"This manifest was generated dynamically","viewingDirection":"left-to-right","sequences":[{"@type":"sc:Sequence","canvases":[{"@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/canvas/page-1.json","@type":"sc:Canvas","label":"Page 1","height":1650,"width":1275,"images":[{"@type":"oa:Annotation","motivation":"sc:painting","resource":{"@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/15%2F48%2F56%2F154856872216879799430111655782770892627/full/full/0/default.jpg","@type":"dctypes:Image","format":"image/jpeg","height":1650,"width":1275,"service":{"@context":"http://iiif.io/api/image/2/context.json","@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/15%2F48%2F56%2F154856872216879799430111655782770892627","profile":"http://iiif.io/api/image/2/level2.json"}},"on":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/canvas/page-1.json"}]}]}]}