Testing task schedulers on Linux system

DOI10.1007/978-90-481-9112-3_65MaRDI QIDQ4930271zbMATH OpenOpenAlexFDO

Authors Leonardo Jelenković, Stjepan Groš, Domagoj Jakobovic

Publication date 28 September 2010

Published in Innovations in Computing Sciences and Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-90-481-9112-3_65

zbMATH Keywords

testing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Theory of operating systems (68N25)

Recommendations

• Analysis on the mechanism of Linux process scheduler
• scientific article; zbMATH DE number 1497769
• Processor bounding for an efficient non-preemptive task scheduling algorithm
• scientific article; zbMATH DE number 1863252
• scientific article; zbMATH DE number 2112450

Cited in

(2)

• PI-ping - benchmark tool for testing latencies and throughput in operating systems
• Analysis on the mechanism of Linux process scheduler

This page was built for publication: Testing task schedulers on Linux system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930271)