Efficient implementation of multiprocessor scheduling algorithms on a simulation testbed

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 method...

Full description

Saved in:
Bibliographic Details
Published in:Software, practice & experience Vol. 35; no. 1; pp. 27 - 50
Main Authors: Ramos, Jorge R., Rego, Vernon
Format: Journal Article
Language:English
Published: Chichester, UK John Wiley & Sons, Ltd 01.01.2005
Subjects:
ISSN:0038-0644, 1097-024X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ArticleID:SPE625
istex:FD82560B1BD03962E248FD0BF6EBFF16ECD8D67B
DoD - No. DAAG55-98-1-0246; No. PRF-6903235
ark:/67375/WNG-344S5XWH-K
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0038-0644
1097-024X
DOI:10.1002/spe.625