Title
Optimal Workload for a Multi-Tasking k-out-of-n: G Load Sharing System
Abstract
In this paper the problem of determining optimal workload for a load sharing system is considered. The system is composed of total n components and it functions until (n - k + 1) components are failed. The works that should be performed by the system arrive at the system according to a homogeneous Poisson process and it is assumed that the system can perform sufficiently large number of works simultaneously. The system is subject to a workload which can be expressed in terms of the arrival rate of the work and the workload is equally shared by surviving components in the system. We assume that an increased workload induces a higher failure rate of each remaining component. The time consumed for the completion of each work is assumed to be a constant or a random quantity following an Exponential distribution. Under this model, as a measure for system performance, we derive the long-run average number of works performed per unit time and consider optimal workload which maximizes the system performance.
Year
DOI
Venue
2006
10.1093/ietfec/e89-a.1.288
IEICE Transactions
Keywords
Field
DocType
multi-tasking k-out-of-n,optimal workload,long-run average number,unit time,arrival rate,g load,total n component,system performance,higher failure rate,load sharing system,large number,increased workload
Mathematical optimization,Renewal theory,Workload,Failure rate,Theoretical computer science,Real-time computing,Exponential distribution,Human multitasking,Poisson process,Mathematics
Journal
Volume
Issue
ISSN
E89-A
1
0916-8508
Citations 
PageRank 
References 
3
0.45
0
Authors
3
Name
Order
Citations
PageRank
Ji Hwan Cha115926.28
Hisashi Yamamoto230.45
Won Young Yun3738.14