Distributed Cost-Optimized Placement for Latency-Critical Applications in Heterogeneous Environments

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Sökning: L773:9781538651391 > Distributed Cost-Op...

LIBRIS Formathandbok (Information om MARC21)

Fältnamn	Indikatorer	Metadata
000		02877naa a2200337 4500
001		oai:DiVA.org:umu-151457
003		SwePub
008		180904s2018 \| \|\|\|\|\|\|\|\|\|\|\|000 \|\|eng\|
024	7	a https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-1514572 URI
024	7	a https://doi.org/10.1109/ICAC.2018.000222 DOI
040		a (SwePub)umu
041		a engb eng
042		9 SwePub
072	7	a ref2 swepub-contenttype
072	7	a kon2 swepub-publicationtype
100	1	a Mehta, Amardeep,d 1985-u Umeå universitet,Institutionen för datavetenskap,Distributed Systems4 aut0 (Swepub:umu)amam0006
245	1 0	a Distributed Cost-Optimized Placement for Latency-Critical Applications in Heterogeneous Environments
264	1	b IEEE Computer Society,c 2018
338		a print2 rdacarrier
520		a Mobile Edge Clouds (MECs) with 5G will create new opportunities to develop latency-critical applications in domains such as intelligent transportation systems, process automation, and smart grids. However, it is not clear how one can costefﬁciently deploy and manage a large number of such applications given the heterogeneity of devices, application performance requirements, and workloads. This work explores cost and performance dynamics for IoT applications, and proposes distributed algorithms for automatic deployment of IoT applications in heterogeneous environments. Placement algorithms were evaluated with respect to metrics including number of required runtimes, applications’ slowdown, and the number of iterations used to place an application. Iterative search-based distributed algorithms such as Size Interval Actor Assignment in Groups (SIAA G) outperformed random and bin packing algorithms, and are therefore recommended for this purpose. Size Interval Actor Assignment in Groups at Least Utilized Runtime (SIAA G LUR) algorithm is also recommended when minimizing the number of iterations is important. The tradeoff of using SIAA G algorithms is a few extra runtimes compared to bin packing algorithms.
650	7	a TEKNIK OCH TEKNOLOGIERx Elektroteknik och elektronikx Datorsystem0 (SwePub)202062 hsv//swe
650	7	a ENGINEERING AND TECHNOLOGYx Electrical Engineering, Electronic Engineering, Information Engineeringx Computer Systems0 (SwePub)202062 hsv//eng
653		a Mobile Edge Clouds
653		a Fog Computing
653		a IoTs
653		a Distributed algorithms
700	1	a Elmroth, Eriku Umeå universitet,Institutionen för datavetenskap4 aut0 (Swepub:umu)erel0001
710	2	a Umeå universitetb Institutionen för datavetenskap4 org
773	0	t Proceedings of the IEEE 15th International Conference on Autonomic Computing (ICAC)d : IEEE Computer Societyg , s. 121-130q <121-130z 9781538651391
856	4 8	u https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-151457
856	4 8	u https://doi.org/10.1109/ICAC.2018.00022

Hitta via bibliotek

Proceedings of the IEEE 15th International Conference on Autonomic Computing (IC... (Sök värdpublikationen i LIBRIS)

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...: Mehta, Amardeep, ...; Elmroth, Erik

Om ämnet

TEKNIK OCH TEKNOLOGIER: TEKNIK OCH TEKNO ...; och Elektroteknik oc ...; och Datorsystem

Artiklar i publikationen: Proceedings of t ...

Av lärosätet: Umeå universitet

Sök utanför SwePub

Sök vidare i:: Google; Google Book Search; Google Scholar

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

LIBRIS.kb.se