Premium
Efficient implementation of multiprocessor scheduling algorithms on a simulation testbed
Author(s) -
Ramos Jorge R.,
Rego Ver
Publication year - 2005
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.625
Subject(s) - testbed , computer science , interfacing , multiprocessing , modular design , parallel computing , scheduling (production processes) , algorithm , kernel (algebra) , posix threads , thread (computing) , implementation , distributed computing , computer architecture , operating system , programming language , engineering , computer network , computer hardware , operations management , mathematics , combinatorics
A layered and modular approach to implementing a process‐oriented simulator testbed is described. The simulation kernel is supported by a threads library and is, in turn, capable of supporting distinct domains or application areas for various applications. The testbed offers an implementation methodology for testing novel simulation algorithms at the domain level, without interfacing with the kernel. To demonstrate its utility, a novel algorithm for simulating multiprocessing with round‐robin scheduling is presented. The algorithm is more complex than the naïve round‐robin implementation in use, but offers significant performance improvement. Copyright © 2004 John Wiley & Sons, Ltd.