With increases in the performance of computers, it has become possible to provide a large number of services on a single computer. However, since the required execution performance can vary from service to service, it is necessary to guarantee execution performance for each service individually. In addition, it is common for a single service to be composed of multiple processes. Consequently, the ability to regulate execution performance for units consisting of multiple processes is desirable. Therefore, in this paper we propose a mechanism for regulating the execution performance of process groups using execution resources that encapsulate the assignable processor units designed for the Tender operating system. Specifically, executions are managed in a tree-structure and we then regulate execution performance by associating processes with these executions. In addition, we show via an implementation and evaluations that the proposed method is able to regulate the execution performance of process groups well and present an evaluation that makes use of a Web server. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(14): 6378, 2007; Published online in Wiley InterScience (). DOI 10.1002/scj.20403
[1]
Calton Pu,et al.
A feedback-driven proportion allocator for real-rate scheduling
,
1999,
OSDI '99.
[2]
Harrick M. Vin,et al.
A hierarchial CPU scheduler for multimedia operating systems
,
1996,
OSDI '96.
[3]
Paul J. M. Havinga,et al.
QoS scheduling for energy-efficient wireless communication
,
2001,
Proceedings International Conference on Information Technology: Coding and Computing.
[4]
Jason Nieh,et al.
The design, implementation and evaluation of SMART: a scheduler for multimedia applications
,
1997,
SOSP.
[5]
Michael B. Jones,et al.
CPU reservations and time constraints: efficient, predictable scheduling of independent activities
,
1997,
SOSP.