NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
Approximation algorithms for scheduling to minimize the makespan of communicating processes on selected computer networks
dc.contributor.advisor | Friesen, Donald K. | |
dc.creator | Drew, Maxwell Sutherland | |
dc.date.accessioned | 2020-08-21T22:03:27Z | |
dc.date.available | 2020-08-21T22:03:27Z | |
dc.date.issued | 1980 | |
dc.identifier.uri | https://hdl.handle.net/1969.1/DISSERTATIONS-644906 | |
dc.description | Typescript (photocopy). | en |
dc.description.abstract | The problem addressed in this research is to determine how to efficiently schedule a task system, in which the precedence relation is a tree, on the processors of centralized and distributed-loop computer networks. In particular, the problem is investigated for the case in which there is a single task that must receive messages from all the other tasks before it can be executed. It is desired to find a schedule for which the makespan, the earliest time at which the tasks have completed execution, is minimal. Previous research [41] suggests this problem is NP-Hard in all but the most trivial cases, when the cost of transferring a message is negligible. It is shown in this research that the problem is also NP-Hard when the tasks all execute in unit time, the message costs are arbitrary, a "time-efficient" policy is used for routing message packets, and the network is a centralized, distributed-loop, or topologically distributed store-and-forward computer network. Because of the complexity of the problem, schedules which produce "almost" optimal solutions are regarded as satisfactory. Two approximation algorithms which produce such schedules are investigated for the cases in which the task system is executed on a centralized or distributed-loop computer network. These cases are in fact shown to be equivalent. An f(m)-approximation algorithm produces schedules whose makespan is no more than m times optimal, where m is the number of processors. This bound is the best possible when m = 2. For m [greater than or equal to] 3 examples exist for which this algorithm produces schedules in which the makespan approaches (2 m+1)/3 times optimal. Constant bounds of 2 and 3 times optimal are established for special cases. The algorithm is also investigated in isolated cases when the tasks are first sorted suboptimally. If n is the number of tasks the worst case time complexity of the algorithm may be expressed as 0(n log n + mn) when the tasks are first sorted. When sorting is not used this time complexity becomes 0(mn)... | en |
dc.format.extent | x, 187 leaves | en |
dc.format.medium | electronic | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | Major computing science | en |
dc.subject.classification | 1980 Dissertation D776 | |
dc.subject.lcsh | Network analysis (Planning) | en |
dc.title | Approximation algorithms for scheduling to minimize the makespan of communicating processes on selected computer networks | en |
dc.type | Thesis | en |
thesis.degree.grantor | Texas A&M University | en |
thesis.degree.name | Doctor of Philosophy | en |
thesis.degree.name | Ph. D | en |
dc.contributor.committeeMember | Lively, William M. | |
dc.contributor.committeeMember | Sielken, R. L. | |
dc.contributor.committeeMember | Williams, G. N. | |
dc.type.genre | dissertations | en |
dc.type.material | text | en |
dc.format.digitalOrigin | reformatted digital | en |
dc.publisher.digital | Texas A&M University. Libraries | |
dc.identifier.oclc | 7933281 |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.