國立虎尾科技大學 |

Optimizing task assignment for collaborative computing over heterogeneous network devices.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Optimizing task assignment for collaborative computing over heterogeneous network devices./
作者:	Kao, Yi-Hsuan.
面頁冊數:	1 online resource (185 pages)
附註:	Source: Dissertation Abstracts International, Volume: 77-11(E), Section: B.
標題:	Electrical engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9781339825984

Optimizing task assignment for collaborative computing over heterogeneous network devices.
Kao, Yi-Hsuan.

Optimizing task assignment for collaborative computing over heterogeneous network devices. - 1 online resource (185 pages)

Source: Dissertation Abstracts International, Volume: 77-11(E), Section: B.

Thesis (Ph.D.)--University of Southern California, 2016.

Includes bibliographical references

The Internet of Things promises to enable a wide range of new applications involving sensors, embedded devices and mobile devices. Different from traditional cloud computing, where the centralized and powerful servers offer high quality computing service, in the era of the Internet of Things, there are abundant computational resources distributed over the network. These devices are not as powerful as servers, but are easier to access with faster setup and short-range communication. However, because of energy, computation, and bandwidth constraints on smart things and other edge devices, it will be imperative to collaboratively run a computational-intensive application that a single device cannot support individually. As many IoT applications, like data processing, can be divided into multiple tasks, we study the problem of assigning such tasks to multiple devices taking into account their abilities and the costs, and latencies associated with both task computation and data communication over the network.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9781339825984Subjects--Topical Terms:

596380
Electrical engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Optimizing task assignment for collaborative computing over heterogeneous network devices.
LDR:05260ntm a2200373K 4500 001 915247
005 20180727125211.5
006 m o u
007 cr mn||||a|a||
008 190606s2016 xx obm 000 0 eng d
020 $a 9781339825984
035 $a (MiAaPQ)AAI10124490
035 $a (MiAaPQ)usc:15760
035 $a AAI10124490
040 $a MiAaPQ $b eng $c MiAaPQ
100 1 $a Kao, Yi-Hsuan. $3 1188550
245 1 0 $a Optimizing task assignment for collaborative computing over heterogeneous network devices.
264 0 $c 2016
300 $a 1 online resource (185 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 77-11(E), Section: B.
500 $a Adviser: Bhaskar Krishnamachari.
502 $a Thesis (Ph.D.)--University of Southern California, 2016.
504 $a Includes bibliographical references
520 $a The Internet of Things promises to enable a wide range of new applications involving sensors, embedded devices and mobile devices. Different from traditional cloud computing, where the centralized and powerful servers offer high quality computing service, in the era of the Internet of Things, there are abundant computational resources distributed over the network. These devices are not as powerful as servers, but are easier to access with faster setup and short-range communication. However, because of energy, computation, and bandwidth constraints on smart things and other edge devices, it will be imperative to collaboratively run a computational-intensive application that a single device cannot support individually. As many IoT applications, like data processing, can be divided into multiple tasks, we study the problem of assigning such tasks to multiple devices taking into account their abilities and the costs, and latencies associated with both task computation and data communication over the network.
520 $a A system that leverages collaborative computing over the network faces highly variant run-time environment. For example, the resource released by a device may suddenly decrease due to the change of states on local processes, or the channel quality may degrade due to mobility. Hence, such a system has to learn the available resources, be aware of changes and flexibly adapt task assignment strategy that efficiently makes use of these resources.
520 $a We take a step by step approach to achieve these goals. First, we assume that the amount of resources are deterministic and known. We formulate a task assignment problem that aims to minimize the application latency (system response time) subject to a single cost constraint so that we will not overuse the available resource. Second, we consider that each device has its own cost budget and our new multi-constrained formulation clearly attributes the cost to each device separately. Moving a step further, we assume that the amount of resources are stochastic processes with known distributions, and solve a stochastic optimization with a strong QoS constraint. That is, instead of providing a guarantee on the average latency, our task assignment strategy gives a guarantee that p% of time the latency is less than t, where p and t are arbitrary numbers. Finally, we assume that the amount of run-time resources are unknown and stochastic, and design online algorithms that learn the unknown information within limited amount of time and make competitive task assignment.
520 $a We aim to develop algorithms that efficiently make decisions at run-time. That is, the computational complexity should be as light as possible so that running the algorithm does not incur considerable overhead. For optimizations based on known resource profile, we show these problems are NP-hard and propose polynomial-time approximation algorithms with performance guarantee, where the performance loss caused by sub-optimal strategy is bounded. For online learning formulations, we propose light algorithms for both stationary environment and non-stationary environment and show their competitiveness by comparing the performance with the optimal offline policy (solved by assuming the resource profile is known).
520 $a We perform comprehensive numerical evaluations, including simulations based on trace data measured at application run-time, and validate our analysis on algorithm's complexity and performance based on the numerical results. Especially, we compare our algorithms with the existing heuristics and show that in some cases the performance loss given by the heuristic is considerable due to the sub-optimal strategy. Hence, we conclude that to efficiently leverage the distributed computational resource over the network, it is essential to formulate a sophisticated optimization problem that well captures the practical scenarios, and provide an algorithm that is light in complexity and suggests a good assignment strategy with performance guarantee.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Electrical engineering. $3 596380
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0544
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Southern California. $b Electrical Engineering. $3 845473
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10124490 $z click for full text (PQDT)