Một cách tiếp cận việc cấp phát tài nguyên máy chủ ảo theo thời khóa biểu tại trường Đại học

0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Minh Phụng Bùi, Xuân An Bùi

Ngôn ngữ: vie

Ký hiệu phân loại: 650.11 Time management

Thông tin xuất bản: Khoa học (Đại học Văn Lang), 2018

Mô tả vật lý: 61-65

Bộ sưu tập: Metadata

ID: 535892

Thêm vào giỏ

Tóm tắt
Chủ đề

At universities today, the need to use computational resources to support teaching, learning and research is becoming increasingly popular. However, the process of allocating resources for the virtual server is manual and the allocation of CPU, RAM, NETWORK resources to each virtual server has not been optimized for the minimum number of physical servers to use. There are also some algorithms to optimize allocation such as Vector Bin Packing, FFD, Heuristic but not yet meet the allocation of resources for some organizations such as universities, need to allocate - withdraw virtual servers. flexible and continuous based on a schedule. The paper proposes an algorithm that combines with the Heuristic Norm-based Greedy (L2) algorithm to allocate resources to the virtual server automatically based on a timetable inserted from time to time.Tại các trường đại học ngày nay, nhu cầu sử dụng tài nguyên tính toán để hỗ trợ cho việc dạy, học và nghiên cứu đang dần trở nên phổ biến. Tuy nhiên, quá trình cấp phát tài nguyên cho máy chủ ảo đang phải làm thủ công và việc cấp phát tài nguyên CPU, RAM, NETWORK cho từng máy chủ ảo chưa được tối ưu về số lượng máy chủ vật lý tối thiểu cần dùng. Cũng đã có một số thuật toán nhằm tối ưu việc cấp phát như Vector Bin Packing, FFD, Heuristic nhưng chưa đáp ứng được việc cấp phát tài nguyên cho một số tổ chức như trường đại học, cần cấp phát - thu hồi máy chủ ảo linh động và liên tục dựa theo một thời khóa biểu. Bài viết đề xuất một thuật toán kết hợp với thuật toán Heuristic Norm-based Greedy (L2) để cấp phát tài nguyên cho máy chủ ảo một cách tự động dựa trên một thời khóa biểu được đưa vào theo từng thời điểm.

Tạo bộ sưu tập với mã QR