Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/14085
Title: Design, analysis and application of divisible load scheduling strategies in linear daisy chain networks with system constraints
Authors: WONG HAN MIN
Keywords: divisible load theory, divisible loads, linear networks, multiple loads, release times, biological sequence alignment
Issue Date: 2-Aug-2004
Source: WONG HAN MIN (2004-08-02). Design, analysis and application of divisible load scheduling strategies in linear daisy chain networks with system constraints. ScholarBank@NUS Repository.
Abstract: Network based computing systems have proven to be a power tool in processing large computationally intensive loads for various applications. In this thesis, we consider the problem of design, analysis and application of load distribution strategies for divisible loads in linear networks with various real-life system constraints. We utilize the mathematical model adopted by Divisible Load Theory (DLT) literature in the design of our strategies. We investigate several influencing real-life scenarios and systematically derive strategies for each scenario. We consider of real-life scenarios such as scheduling multiple divisible loads, scheduling loads on linear networks with identical and arbitrary release times. Finally, as to complete our analysis on distribution strategies in linear networks, we consider the problem of designing a strategy that is able to fully harness the advantages of the independent links in linear networks. We investigate the problem of aligning biological sequences in the field of bioinformatics.
URI: http://scholarbank.nus.edu.sg/handle/10635/14085
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
DLT_linear.pdf1.56 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

214
checked on Dec 11, 2017

Download(s)

148
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.