umu.sePublikationer
Ändra sökning
Avgränsa sökresultatet
1 - 11 av 11
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Elmroth, Erik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Tordsson, Johan
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Hernandez, Francisco
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Ali-Eldin, Ahmed
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Svärd, Petter
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Sedaghat, Mina
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Li, Wubin
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Self-management Challenges for Multi-cloud Architectures (Invited Paper)2011Ingår i: TOWARDS A SERVICE-BASED INTERNET, Berlin: Springer, 2011, Vol. 6994, s. 38-49Konferensbidrag (Refereegranskat)
    Abstract [en]

    Addressing the management challenges for a multitude of distributed cloud architectures, we focus on the three complementary cloud management problems of predictive elasticity, admission control, and placement (or scheduling) of virtual machines. As these problems are intrinsically intertwined we also propose an approach to optimize the overall system behavior by policy-tuning for the tools handling each of them. Moreover, in order to facilitate the execution of some of the management decisions, we also propose new algorithms for live migration of virtual machines with very high workload and/or over low-bandwidth networks, using techniques such as caching, compression, and prioritization of memory pages.

  • 2.
    Elmroth, Erik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Tordsson, Johan
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Hernández, Francisco
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Ali-Eldin, Ahmed
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Svärd, Petter
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Sedaghat, Mina
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Li, Wubin
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Self-management challenges for multi-cloud architectures2011Ingår i: Towards a Service-Based Internet: 4th European Conference, ServiceWave 2011, Poznan, Poland, October 26-28, 2011. Proceedings / [ed] Witold Abramowicz, Ignacio M. Llorente, Mike Surridge, Andrea Zisman and Julien Vayssière, Springer Berlin/Heidelberg, 2011, s. 38-49Konferensbidrag (Refereegranskat)
    Abstract [en]

    Addressing the management challenges for a multitude of distributed cloud architectures, we focus on the three complementary cloud management problems of predictive elasticity, admission control, and placement (or scheduling) of virtual machines. As these problems are intrinsically intertwined we also propose an approach to optimize the overall system behavior by policy-tuning for the tools handling each of them. Moreover, in order to facilitate the execution of some of the management decisions, we also propose new algorithms for live migration of virtual machines with very high workload and/or over low-bandwidth networks, using techniques such as caching, compression, and prioritization of memory pages.

  • 3.
    Sedaghat, Mina
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Capacity Management Approaches for Compute Clouds2013Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Cloud computing provides the illusion of a seamless, infinite resource pool with flexibleon-demand accessibility. However, behind this illusion there are thousands ofservers and peta-bytes of storage, running tens of thousands of applications accessedby millions of users. The management of such systems is non-trivial because theyface elastic demand, have heterogeneous resources, must fulfill diverse managementobjectives, and are vast in scale.Autonomic computing techniques can be used to tackle the complex problem ofresource management in cloud data centers by introducing self-managing elementsknown as autonomic managers. Each autonomic manager should be capable of managingitself while simultaneously contributing to the fulfillment of high level systemwideobjectives. A wide range of approaches and mechanisms can be used to defineand design these autonomic managers as well as to organize them and coordinate theiractions in order to achieve specific goals.This thesis investigates autonomic approaches for cloud resource management thataim to optimize the cloud infrastructure layer with respect to various high level objectives.The resource management problem is formulated as a problem of optimizationwith respect to one or more management objectives such as cost, profitability, or datacenter utilization, as well as performance concerns such as response time, quality ofservice, and rejection rates. The aim of the reported investigations is to address theproblems of cost-efficient elastic resource provisioning, unified management of cloudresources, and scalability in cloud resource management. This is achieved by introducingthree new concepts in capacity management: the Repacking, Holistic, and Peerto Peer approaches.

  • 4.
    Sedaghat, Mina
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Cluster Scheduling and Management for Large-Scale Compute Clouds2015Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [sv]

    Datormoln har kommit att bli kraftfulla möjliggörare för många nya IT-tjänster. De ger tillgång till mycket storskaliga datorresurser på ett finkornigt och omedelbart sätt. För att tillhandahålla sådana resurser krävs att de underliggande datorcentren kan hantera sina resurser på ett tillförlitligt och effektivt sätt. Frågan hur man ska designa deras resurshanteringssystem är en stor utmaning då de ska kunna hantera mycket stora mängder heterogena resurser som i sin tur ska klara av vitt skilda typer av belastning, ofta med väldigt stora variationer över tid. Därtill ska de typiskt kunna möta en mängd olika krav och målsättningar för hur resurserna ska nyttjas. Autonomiska system kan med fördel användas för att realisera sådana system. Ett autonomt system innehåller ett antal autonoma element som automatiskt kan organisera och hantera sig själva utan stöd av externa regulatorer. Förmågan att hantera sig själva gör dem mycket lämpliga som komponenter i distribuerade system, vilka i sin tur kan bidra till snabbare beslutsprocesser, bättre skalbarhet och högre feltolerans. Denna avhandling fokuserar på algoritmer, modeller och tekniker för autonom hantering av jobb och virtuella resurser i datacenter. Vi introducerar ett decentraliserat resurshanteringssystem som automatiserar resursallokering och konsolidering, schedulerar jobb tillförlitligt med hänsyn till korrelerade fel, samt skalar resurser dynamiskt för att uppnå kostnadseffektivitet. Som en del av detta ramverk introducerar vi en decentraliserad schedulerare som allokerar resurser med hänsyn till att tagna beslut ska vara bra för lång tid och ge låga resurshanteringskostnader för datacenter med dynamisk belastning. Scheduleraren allokerar virtuella maskiner utifrån aktuell belastning och upprätthåller ett effektivt nyttjande av underliggande servrar genom att ta hänsyn till migrationskostnader, topologiska bivillkor och risk för överutnyttjande. Vi introducerar också en resursallokeringsalgoritm som tar hänsyn till korrelerade fel som ett led i planeringen. Avsikten är att kunna uppnå specificerade tillgänglighetskrav för enskilda tjänster trots uppkomst av korrelerade fel. Vi fokuserar främst på korrelerade fel som härrör från problem med elförsörjning och från felande nätverkskomponenter samt deras påverkan på jobb bestående av många identiska del-jobb. Slutligen studerar vi även hur man bäst ska kombinera horisontell och vertikal skalning av resurser. Resultatet är en process som ökar kostnadseffektivitet genom att kombinera de två metoderna och därtill emellanåt förändra fördelning av storlekar på virtuella maskiner.

  • 5.
    Sedaghat, Mina
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Hernandez, Francisco
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    A virtual machine re-packing approach to the horizontal vs. vertical elasticity trade-off for cloud autoscaling2013Ingår i: Proceedings of the 2013 ACM Cloud and Autonomic Computing Conference, ACM Press, 2013, s. Article no. 6-Konferensbidrag (Refereegranskat)
    Abstract [en]

    An automated solution to horizontal vs. vertical elasticity problem is central to make cloud autoscalers truly autonomous. Today's cloud autoscalers are typically varying the capacity allocated by increasing and decreasing the number of virtual machines (VMs) of a predefined size (horizontal elasticity), not taking into account that as load varies it may be advantageous not only to vary the number but also the size of VMs (vertical elasticity). We analyze the price/performance effects achieved by different strategies for selecting VM-sizes for handling increasing load and we propose a cost-benefit based approach to determine when to (partly) replace a current set of VMs with a different set. We evaluate our repacking approach in combination with different auto-scaling strategies. Our results show a range of 7% up to 60% cost saving in total resource utilization cost of our sample applications and workloads.

  • 6.
    Sedaghat, Mina
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Hernandez, Francisco
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Peer to peer resource management for cloud data centersManuskript (preprint) (Övrigt vetenskapligt)
  • 7.
    Sedaghat, Mina
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Hernandez, Francisco
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Unifying cloud management: towards overall governance of business level objectives2011Ingår i: Cluster, Cloud and Grid Computing (CCGrid), 2011 11th IEEE/ACM International Symposium on, IEEE Computer Society , 2011, s. -597Konferensbidrag (Refereegranskat)
    Abstract [en]

    We address the challenge of providing unified cloud resource management towards an overall business level objective, given the multitude of managerial tasks to be performed and the complexity of any architecture to support them. Resource level management tasks include elasticity control, virtual machine and data placement, autonomous fault management, etc, which are intrinsically difficult problems since services normally have unknown lifetime and capacity demands that varies largely over time. To unify the management of these problems, (for optimization with respect to some higher level business level objective, like optimizing revenue while breaking no more than a certain percentage of service level agreements)becomes even more challenging as the resource level managerial challenges are far from independent. After providing the general problem formulation, we review recent approaches taken by the research community, including mainly general autonomic computing technology for large-scale environments and resource level management tools equipped with some business oriented or otherwise qualitative features. We propose and illustrate a policy-driven approach where a high-level management system monitors overall system and services behavior and adjusts lower level policies (e.g., thresholds for admission control, elasticity control, server consolidation level, etc) for optimization towards the measurable business level objectives.

  • 8.
    Sedaghat, Mina
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Hernández-Rodriguez, Francisco
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Autonomic resource allocation for cloud data centers: a peer to peer approach2014Ingår i: 2014 International Conference on Cloud and Autonomic Computing (ICCAC 2014), IEEE Computer Society, 2014, , s. 10s. 131-140Konferensbidrag (Refereegranskat)
    Abstract [en]

    We address the problem of resource management for large scale cloud data centers. We propose a Peer to Peer (P2P) resource management framework, comprised of a number of agents, overlayed as a scale-free network. The structural properties of the overlay, along with dividing the management responsibilities among the agents enables the management framework to be scalable in terms of both the number of physical servers and incoming Virtual Machine (VM) requests, while it is computationally feasible. While our framework is intended for use in different cloud management functionalities, e.g. admission control or fault tolerance, we focus on the problem of resource allocation in clouds. We evaluate our approach by simulating a data center with 2500 servers, striving to allocate resources to 20000 incoming VM placement requests. The simulation results indicate that by maintaining an efficient request propagation, we can achieve promising levels of performance and scalability when dealing with large number of servers and placement requests.

  • 9.
    Sedaghat, Mina
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Hernández-Rodriguez, Francisco
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Decentralized cloud datacenter reconsolidation through emergent and topology-aware behavior2016Ingår i: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 56, s. 51-63Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Consolidation of multiple applications on a single Physical Machine (PM) within acloud data center can increase utilization, minimize energy consumption, and reduceoperational costs. However, these benefits comes at the cost of increasing the complex-ity of the scheduling problem.In this paper, we present a topology-aware resource management framework. Aspart of this framework, we introduce a Reconsolidating PlaceMent scheduler (RPM)that provides and maintains durable allocations with low maintenance costs for datacenters with dynamic workloads. We focus on workloads featuring both short-livedbatch jobs and latency-sensitive services such as interactive web applications. Thescheduler assigns resources to Virtual Machines (VMs) and maintains packing effi-ciency while taking into account migration costs, topological constraints, and the riskof resource contention, as well as the variability of the background load and its com-plementarity to the new VM.We evaluate the model by simulating a data center with over 65000 PMs, structuredas a three-level multi-rooted tree topology. We investigate trade-offs between factorsthat affect the durability and operational cost of maintaining a near-optimal packing.The results show that the proposed scheduler can scale to the number of PMs in thesimulation and maintain efficient utilization with low migration costs.

  • 10.
    Sedaghat, Mina
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Hernández-Rodriguez, Francisco
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Girdzijauskas, Šarūnas
    Divide the task, multiply the outcome: cooperative VM consolidation2014Ingår i: Proceedings of The 6th IEEE International Conference on Cloud Computing Technology and Science (CloudCom 2014), IEEE, 2014, , s. 6s. 300-305Konferensbidrag (Refereegranskat)
    Abstract [en]

    Efficient resource utilization is one of the mainconcerns of cloud providers, as it has a direct impact onenergy costs and thus their revenue. Virtual machine (VM)consolidation is one the common techniques, used by infrastruc-ture providers to efficiently utilize their resources. However,when it comes to large-scale infrastructures, consolidationdecisions become computationally complex, since VMs aremulti-dimensional entities with changing demand and unknownlifetime, and users often overestimate their actual demand.These uncertainties urges the system to take consolidationdecisions continuously in a real time manner.In this work, we investigate a decentralized approach forVM consolidation using Peer to Peer (P2P) principles. Weinvestigate the opportunities offered by P2P systems, as scalableand robust management structures, to address VM consol-idation concerns. We present a P2P consolidation protocol,considering the dimensionality of resources and dynamicityof the environment. The protocol benefits from concurrencyand decentralization of control and it uses a dimension awaredecision function for efficient consolidation. We evaluate theprotocol through simulation of 100,000 physical machinesand 200,000 VM requests. Results demonstrate the potentialsand advantages of using a P2P structure to make resourcemanagement decisions in large scale data centers. They showthat the P2P approach is feasible and scalable and producesresource utilization of 75% when the consolidation aim is 90%.

  • 11.
    Sedaghat, Mina
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Wadbro, Eddie
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Wilkes, John
    Sjöstedt de Luna, Sara
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
    Seleznjev, Oleg
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    DieHard: Reliable Scheduling to Survive Correlated failures in Cloud Data Centers2016Ingår i: 2016 16th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), IEEE, 2016Konferensbidrag (Refereegranskat)
    Abstract [en]

    In large scale data centers, a single fault can lead to correlated failures of several physical machines and the tasks running on them, simultaneously. Such correlated failures can severely damage the reliability of a service or a job running on the failed hardware. This paper models the impact of stochastic and correlated failures on job reliability in a data center. We focus on correlated failures caused by power outages or failures of network components, on jobs running multiple replicas of identical tasks. We present a statistical reliability model and an approximation technique for computing a job’s reliability in the presence of correlated failures. In addition, we address the problem of scheduling a job with reliability constraints.We formulate the scheduling problem as an optimization problem, with the aim being to maintain the desired reliability with the minimum number of extra tasks to resist failures.We present a scheduling algorithm that approximates the minimum number of required tasks and a placement to achieve a desired job reliability. We study the efficiency of our algorithm using an analytical approach and by simulating a cluster with different failure sources and reliabilities. The results show that the algorithm can effectively approximate the minimum number of extra tasks required to achieve the job’s reliability.

1 - 11 av 11
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf