DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Park, Kyu-Ho | - |
dc.contributor.advisor | 박규호 | - |
dc.contributor.author | Seo, Kyung-Ryong | - |
dc.contributor.author | 서경룡 | - |
dc.date.accessioned | 2011-12-14 | - |
dc.date.available | 2011-12-14 | - |
dc.date.issued | 1995 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=101741&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/36299 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전기및전자공학과, 1995.8, [ vi, 110 p. ] | - |
dc.description.abstract | In a multi-computer systems, a job is usually decomposed into several cooperating modules which are then assigned to a set of processors in the system to exploit the inherent parallelism in job execution and to make use of computational capabilities and resources of the system efficiently. In this thesis, we investigated the problem of assigning tasks onto multi-computers. The problem involves the development of task allocation models for the multi-computer system. The model must allocate tasks among processors to archive the following goals: - To accommodate specification of a large number of constraints to facilitate a variety of engineering application requirements. - To balance the utilization of individual processors in the distributed computing system. and - To minimize interprocessor communication cost. In this thesis, we first deal with static task assignment problem for the host-satellite multi-computer system. The assignment problem, which is the problem of assigning the task modules of a task to the processors of a multi-computer system is known to be NP-complete in its most general cases. Previous work on this problem has shown in tractable for a system of two processors[Stone77]. We propose a graph theoretic approach which finds optimal solutions for the general multiple-satellite system. Our work is an extension of the Stone``s two-processor approach to the case for the multiple-satellite system. The problem is solved by applying the well-known network flow algorithm in the related two-terminal network graphs. Therefore, the task assignment problem in a homogeneous satellite system can be solved in time no worse than $O(NM^3)$ by applying the network flow algorithm, where N and M are the number of satellites and the number of modules, respectively. Secondly, the task allocation problem for the heterogeneous multi-computer system is concerned. In general, we are considering a heterogeneous processor system in which each processor may have different... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Heuristic | - |
dc.subject | Load Balancing | - |
dc.subject | Task Allocation | - |
dc.subject | Cost Function | - |
dc.subject | 비용함수 | - |
dc.subject | 휴리스틱 | - |
dc.subject | 균등분배 | - |
dc.subject | 일의 할당 | - |
dc.title | Load balancing on multi-computer systems | - |
dc.title.alternative | 다중컴퓨터에서 일의 균등분배에 관한 연구 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 101741/325007 | - |
dc.description.department | 한국과학기술원 : 전기및전자공학과, | - |
dc.identifier.uid | 000885204 | - |
dc.contributor.localauthor | Park, Kyu-Ho | - |
dc.contributor.localauthor | 박규호 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.