Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Limits of instruction-level parallelism
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
Single instruction stream parallelism is greater than two
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Limits of control flow on parallelism
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Control of loop parallelism in multithreaded code
PACT '95 Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques
A Chip-Multiprocessor Architecture with Speculative Multithreading
IEEE Transactions on Computers
The Superthreaded Processor Architecture
IEEE Transactions on Computers
Scheduled Dataflow: Execution Paradigm, Architecture, and Performance Evaluation
IEEE Transactions on Computers - Special issue on the parallel architecture and compilation techniques conference
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Fundamentals of Performance Modeling
Fundamentals of Performance Modeling
A hybrid closed queuing network model for multi-threaded dataflow architecture
Computers and Electrical Engineering
Performance analysis of reconfigurable processors using MVA analysis
ARC'12 Proceedings of the 8th international conference on Reconfigurable Computing: architectures, tools and applications
| Hi-index | 0.24 |
Multi-threading has been proposed as an execution model for massively built parallel processors. Due to the large amount of potential parallelism, resource management is a critical issue in multi-threaded architecture. The challenge of multi-threading is to hide the latency by switching among a set of ready threads and thus to improve the processor utilization. Threads are dynamically scheduled to execute based on availability of data. In this paper, two hybrid open queuing network models are proposed. Two sets of processors: synchronization processors and execution processors exist. Each processor is modeled as a server serving a single-queue or multiple-servers serving a single-queue. Performance measures like response times, system throughput and average queue lengths are evaluated for both the hybrid models. The utilizations of the two models are derived and compared with each other. A mean value analysis is performed and different performance measures are plotted.