Thông tin chung
  English
  Đề tài NC khoa học
  Bài báo, báo cáo khoa học
  Hướng dẫn Sau đại học
  Sách và giáo trình
  Các học phần và môn giảng dạy
  Giải thưởng khoa học, Phát minh, sáng chế
  Khen thưởng
  Thông tin khác
  Tài liệu tham khảo
  Hiệu chỉnh
 
Số người truy cập: 107,386,146

 A New Technical Solution Prevention Deadlock for Resource Allocation in Heterogeneous Distributed Platforms
Tác giả hoặc Nhóm tác giả: Nguyen Ha Huy Cuong; Dang Hung Vi; Le Van Son; Nguyen Thanh Thuy
Nơi đăng: India (IJCSN)
cvs weekly sale shauneutsey.com prescription savings cards
walgreens pharmacy coupon walgreen online coupons promo codes walgreens
; Số: Volume 4;Từ->đến trang: 266 - 272;Năm: 2015
Lĩnh vực: Công nghệ thông tin; Loại: Bài báo khoa học; Thể loại: Quốc tế
TÓM TẮT
An allocation of resources to a virtual machine specifies the maximum amount of each individual element of each resource type that will be utilized, as well as the aggregate amount of each resource of each type. An allocation is thus represented by two vectors, a maximum elementary allocation vector and an aggregate allocation vector. There are more general types of resource allocation problems than those we consider here. In this paper, we present an approach for improving the deadlock prevention algorithm, to schedule the policies of resource supply for resource allocation on heterogeneous. The deadlock prevention algorithm has a run time complexity of O (min (m, n)), where m is the number of resources and n is the number of processes. We propose the algorithm for allocating multiple resources to competing services running in virtual machines on a heterogeneous distributed platform. The experiments also compare the performance of the proposed approach with other related work.
ABSTRACT
An allocation of resources to a virtual machine specifies the maximum amount of each individual element of each resource type that will be utilized, as well as the aggregate amount of each resource of each type. An allocation is thus represented by two vectors, a maximum elementary allocation vector and an aggregate allocation vector. There are more general types of resource allocation problems than those we consider here. In this paper, we present an approach for improving the deadlock prevention algorithm, to schedule the policies of resource supply for resource allocation on heterogeneous. The deadlock prevention algorithm has a run time complexity of O (min (m, n)), where m is the number of resources and n is the number of processes. We propose the algorithm for allocating multiple resources to competing services running in virtual machines on a heterogeneous distributed platform. The experiments also compare the performance of the proposed approach with other related work.
walgreens pharmacy coupon site promo codes walgreens
© Đại học Đà Nẵng
 
 
Địa chỉ: 41 Lê Duẩn Thành phố Đà Nẵng
Điện thoại: (84) 0236 3822 041 ; Email: dhdn@ac.udn.vn