ABSTRACT
In this paper a behavioral distinction of soft real-time tasks is introduced. The distinction is based on the behavior of the previous instance of each task and it is used to propose a scheduling algorithm. The algorithm, called BIDS, uses well-known server mechanisms with an extension to handle two priority queues within each server. The priority of a server is managed accordingly to the result that its associated task produce. Along with the formal presentation of the algorithm and the proofs of its properties some performance evaluations based on simulations are included.
- L. Abeni and G. Buttazzo. Integrating multimedia applications in hard real-time systems. In Proceedings of the 19th IEEE RTSS, Madrid, Spain, 1998. IEEE Computer Society. Google ScholarDigital Library
- A. Cervin and J. Eker. The control server: A computational model for real-time control tasks. In Proceedings of the 15th Euromicro Conference on Real-Time Systems (ECRTS'03), page 113, Los Alamitos, CA, USA, 2003. IEEE Computer Society.Google ScholarCross Ref
- R. Davis and A. J. Wellings. Dual priority scheduling. In In Proceedings of the 16th IEEE RTSS, Pisa, Italy, 1995. IEEE Computer Society. Google ScholarDigital Library
- Institute of Electrical and Electronics Engineers. IEEE P1451.2 D2.01 IEEE Draft Standard for A Smart Transducer Interface for Sensors and Actuators - Transducer to Microprocessor Communication Protocols and Transducer Electronic Data Sheet (TEDS) Formats, august 1996.Google Scholar
- H. Jin, Q. Hu, X. Liao, H. Chen, and D. Deng. Imac: an importance-level based adaptive cpu scheduling scheme for multimedia and non-real time applications. In Proceedings of the 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005). IEEE Computer Society, January 2005. Google ScholarDigital Library
- N. Kosugi, A. Mitsuzawa, and M. Tokoro. Importance-based scheduling for predictable real-time systems using mart. In Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems, pages 95--100, Washington, DC, USA, April 1996. IEEE Computer Society. Google ScholarDigital Library
- C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46--61, 1973. Google ScholarDigital Library
- L. Marzario, G. Lipari, P. Balbastre, and A. Crespo. Iris: A new reclaiming algorithm for server-based real-time systems. In Proceedings of the 10th IEEE RTAS, Toronto, Canada, 2004. IEEE Computer Society. Google ScholarDigital Library
- T. Nolte, M. Nolin, and H. Hansson. Real-time server-based communication with can. IEEE Transactions on Industrial Informatics, 1(3):192--201, august 2005.Google Scholar
- J. Real and A. Crespo. Mode change protocols for real-time systems: A survey and a new proposal. Real-Time Systems, 26(2):161--197, 2004. Google ScholarDigital Library
Index Terms
A behavior priority driven approach for resource reservation scheduling
Recommendations
Implementing a Multi-layer Job Scheduling Approach with Effective Load Balancing and Energy Saving over a Cloud
ICIME 2018: Proceedings of the 2018 10th International Conference on Information Management and EngineeringInitially the client server database is created on the cloud. The servers are hereby categorized according to their processing time, speed and RAMs. On the basis of these configurational parameters they are classified as higher, intermediate and lower ...
Scheduling and Priority Mapping for Static Real-Time Middleware
Special issue on challenges in design and implementation of middlewares for real time systemsThis paper presents a middleware real-time scheduling technique for static, distributed, real-time applications. The technique uses global deadline monotonic priority assignment to clients and the Distributed Priority Ceiling protocol to provide concurrency ...
Priority retrial queueing model operating in random environment with varying number and reservation of servers
We consider a multi-server queueing system with two types of customers operating in the Markovian random environment. Under the fixed state of the random environment, the arrival flow is described by the marked Markovian arrival process. Type 1 ...
Comments