Addressing Resource Fragmentation in Grids through Network-Aware Meta-scheduling in Advance

2011 ◽  
Author(s):  
Luis Tom´s ◽  
Carmen Carrión ◽  
Blanca Caminero ◽  
Agustín Caminero
Keyword(s):  
Resource Fragmentation

Improving grid performance through processor allocation considering both speed heterogeneity and resource fragmentation

2010 ◽  
Vol 60 (3) ◽  
pp. 311-337 ◽  
Author(s):  
Po-Chi Shih ◽  
Kuo-Chan Huang ◽  
Yeh-Ching Chung
Keyword(s):  
Processor Allocation ◽  
Resource Fragmentation

The More the Merrier? Natural Resource Fragmentation and the Wealth of Nations

Kyklos ◽  
2011 ◽  
Vol 64 (4) ◽  
pp. 500-515 ◽  
Author(s):  
Benoit S Y Crutzen ◽  
Sarah Holton
Keyword(s):  
Natural Resource ◽  
Resource Fragmentation ◽  
Wealth Of Nations

scholarly journals Placement Strategy for Intercommunicating Tasks of an Elastic Request in Fog-Cloud Environment

2019 ◽  
Vol 20 (2) ◽  
pp. 335-348
Author(s):  
R. Sridharan ◽  
S. Domnic
Keyword(s):  
Resource Utilization ◽  
Bin Packing ◽  
Fog Computing ◽  
Life Time ◽  
Cloud Environment ◽  
First Come First Serve ◽  
Current Resource ◽  
Simulation Results ◽  
Resource Fragmentation ◽  
Additional Constraints

Cloud computing hosts large number of modern day applications using the virtualization concept. However, end-to-end network latencies are detrimental to the performance of IoT (Internet of Things) applications like video surveillance and health monitoring. Although edge/fog computing alleviates the latency concerns to some extent, it is still not suitable for applications having intercommunicating tasks. Further, these applications can be elastic in nature and demand more tasks during their life-time. To address this gap, in this paper a network aware co-allocation strategy for the tasks of an individual applications is proposed. After modelling the problem using bin packing approach with additional constraints, the authors propose a novel heuristic IcAPER,(Inter-communication Aware Placement for Elastic Requests) algorithm. The proposed algorithm uses the network neighborhood machine for placement, once current resource is fully utilized by the application. Using CloudsimPlus simulator the performance IcAPER algorithm is compared with First Come First Serve (FCFS), Random and First Fit Decreasing (FFD) algorithms for the parameters (a) resource utilization (b) resource fragmentation and (c) Number of requests having intercommunicating tasks placed on to same PM. Extensive simulation results shows IcAPER maps 34% more tasks on to the same PM and also increase the resource utilization by 13% while decreasing the resource fragmentation by 37.8% when compared to other algorithms in our consideration.

scholarly journals VR-Cluster: Dynamic Migration for Resource Fragmentation Problem in Virtual Router Platform

2016 ◽  
Vol 2016 ◽  
pp. 1-14
Author(s):  
Xianming Gao ◽  
Baosheng Wang ◽  
Xiaozhe Zhang
Keyword(s):  
Resource Management ◽  
Network Architecture ◽  
High Performance ◽  
Network Virtualization ◽  
Mapping Algorithms ◽  
Mapping Algorithm ◽  
Advantages And Disadvantages ◽  
Cluster Dynamic ◽  
Resource Fragmentation ◽  
Management Plane

Network virtualization technology is regarded as one of gradual schemes to network architecture evolution. With the development of network functions virtualization, operators make lots of effort to achieve router virtualization by using general servers. In order to ensure high performance, virtual router platform usually adopts a cluster of general servers, which can be also regarded as a special cloud computing environment. However, due to frequent creation and deletion of router instances, it may generate lots of resource fragmentation to prevent platform from establishing new router instances. In order to solve “resource fragmentation problem,” we firstly propose VR-Cluster, which introduces two extra function planes including switching plane and resource management plane. Switching plane is mainly used to support seamless migration of router instances without packet loss; resource management plane can dynamically move router instances from one server to another server by using VR-mapping algorithms. Besides, three VR-mapping algorithms including first-fit mapping algorithm, best-fit mapping algorithm, and worst-fit mapping algorithm are proposed based on VR-Cluster. At last, we establish VR-Cluster protosystem by using general X86 servers, evaluate its migration time, and further analyze advantages and disadvantages of our proposed VR-mapping algorithms to solve resource fragmentation problem.

Sign in / Sign up

Export Citation Format

Share Document