Logo image
A performance model of multiple resource allocation to tasks with varying demands
Journal article   Peer reviewed

A performance model of multiple resource allocation to tasks with varying demands

Constantine Katsinis and Amelie Constant
Computers & electrical engineering, v 21(4), pp 281-297
01 Jul 1995

Abstract

commodity-type resources Markov chains Resource allocation resource sharing
With the rapid development of multiprocessor systems it is possible that tasks require a number of resources (processors, buffers or communication channels) before they resume execution. This paper examines this problem of multiple resource allocation and presents the study of a system with a set of identical resources. Multiple tasks generate varying requests for a number of resources, are queued and eventually served, and then enter a state for a period of time where they generate no requests before this process is repeated. The procedures that regulate the resource allocation are described, and a Markovchain based solution to the model is developed to produce the system state probabilities, and utilization and performance measures.

Metrics

9 Record Views

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
Web of Science research areas
Computer Science, Hardware & Architecture
Computer Science, Interdisciplinary Applications
Engineering, Electrical & Electronic
Logo image