IJPAM: Volume 16, No. 1 (2004)

MODELING SCHEDULED DATAFLOW
ARCHITECTURE: AN OPEN QUEUING
NETWORK MODEL APPROACH

Vidhyacharan Bhaskar$^1$, Laurie L. Joiner$^2$
$^1$Departement Genie des Systemes d'Information
et de Telecommunication
Universite de Technologie de Troyes
10010 Troyes Cedex, FRANCE
e-mail: Vidhyacharan.Bhaskar@utt.fr
$^2$Department of Electrical and Computer Engineering
University of Alabama in Huntsville
Huntsville, AL 35899, USA
e-mail: ljoiner@ece.uah.edu


Abstract.Scheduled dataflow architecture (SDF) executes instructions in the prescribed order in which they arrive, even though data might already be available for executing the instructions. In this paper, we model the SDF using an open queuing network with feedback. Two models are proposed. The first model is comprised of a network of single queues each with a dedicated processor (server), while the second model is comprised of multiple servers for a single queue. A simulation is performed using mean value analysis on the network of queues. The average response time is computed for different numbers of synchronization and execution units in the processor. The paper also provides a comparison between the utilization of the queuing model with multiple servers and the queuing model with a single server. The two models depict the scheduling of instructions in the dataflow architecture in an efficient manner.

Received: June 6, 2004

AMS Subject Classification: 68M20

Key Words and Phrases: threads, traffic intensity, average queue lengths, average response times, average number of jobs, network utilization

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2004
Volume: 16
Issue: 1