Contributed Session Thu.1.H 3503

Thursday, 10:30 - 12:00 h, Room: H 3503

Cluster 23: Telecommunications & networks [...]

Allocation problems


Chair: Anders Nordby Gullhav



Thursday, 11:00 - 11:25 h, Room: H 3503, Talk 2

Anders Nordby Gullhav
Service deployment in cloud data centers regarding quality of service (QoS) requirements

Coauthor: Bjørn Nygreen


Cloud computing and its Software-as-a-Service (SaaS) model has made impact on the way ICT services are being delivered to the users, and gives providers more flexibility in scaling the services according to the demand. In the provisioning, a SaaS provider needs to focus on cost- and energy-efficient operation of its private cloud, and ensure that the services deployed on the nodes in the cloud have a QoS satisfying the agreed requirements. In this talk, we mainly focus on decisions of a SaaS provider related to the management of his services and cloud data centers, but also acknowledge decisions related to bursting services into public clouds. A service is modeled as a collection of distinct components, and increased QoS is obtained by adding active or passive copies of these, leading to several ways to satisfy the QoS requirements. We will present (M)IP models of a problem where the goal is to minimize the cost of running services in private and public clouds, while ensuring satisfactory QoS. Firstly a direct formulation is created, and then we reformulate the model, utilizing column generating techniques with pregeneration of node patterns, by which we achieve better results.



Thursday, 11:30 - 11:55 h, Room: H 3503, Talk 3

Deepak Garg
Heuristic mathematical models for solving dynamic task assignment problem in distributed real time systems

Coauthors: Harendra Kumar, Manisha Sharma


Efficient task scheduling is a crucial step to achieve high performance for multiprocessor platform remains one of the challenging problems despite of the numerous studies. In a distributed real time systems (DRTS) the tasks of a program must be assigned dynamically to the heterogeneous processors, so as to utilize the computational capabilities and resources of the system efficiently. This paper deals with dynamical task assignment problem for allocating the m tasks of distributed program to n heterogeneous processors (m > n) to minimize the total cost of the program, which permits each task to be migrated from one processor to another during the execution of the program. To design the mathematical model, phase wise execution cost (EC), intertask communication cost (ITCC), migration cost (MC) and residence cost (RC) of each task on each processor has been taken in the form of matrices.


  Payday Loans In Texas. Of course, the choice is not that easy, as there exist great number of different preparations. Notwithstanding, Buy Cialis is the one that definitely differs from all other products.