Calculating a round-robin scheduler

M. Vaccari, A. Matteo, R.C. Backhouse

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

Kropf has collected together a number of problems that can be used as benchmarks for hardware verification, one of which is a bus arbiter. The function of the bus arbiter is to assign the use of a shared resource on each clock cycle to one out of N subsystems that may want to use it, and in such a way that no subsystem is denied access forever. The most significant component in its implementation is a round-robin scheduler. Rather than verify the existing implementation of the scheduler, this paper shows how to construct a correct implementation from the given requirements. We make use of both point-free and pointwise relation algebra.
Original languageEnglish
Title of host publicationMathematics of Program Construction (Proceedings 4th International Conference, MPC'98, Marstrand, Sweden, July 15-17, 1998)
EditorsJ. Jeuring
Place of PublicationBerlin
PublisherSpringer
Pages365-382
ISBN (Print)3-540-64591-8
DOIs
Publication statusPublished - 1998

Publication series

NameLecture Notes in Computer Science
Volume1422
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Calculating a round-robin scheduler'. Together they form a unique fingerprint.

Cite this