Corpus ID: 18822932

Proposal and Design of a Parallel Queue Processor Architecture (PQP)

@inproceedings{Sowa2002ProposalAD,
  title={Proposal and Design of a Parallel Queue Processor Architecture (PQP)},
  author={Masahiro Sowa and Ben A. Abderazek and Soichi Shigeta and Kirilka Nikolova and Tsutomu Yoshinaga},
  booktitle={IASTED PDCS},
  year={2002}
}
In this paper, we propose a parallel Queue processor architecture (PQP) that uses Queue data structure for operands and results manipulations. The above architecture project, which started a couple of years ago here at Sowa laboratory, features simple pipeline, compact Queue based instruction set architecture, and is targeted for Internet applications and new class of terminals requiring small memory footprints and short programs run-times. The proposed architecture has been designed and then… Expand
Parallel Queue Processor Architecture Based on Produced Order Computation Model
TLDR
It is shown that Datum is inserted in the queue-registers in produced order scheme and can be reused, which has profound implications in the areas of parallel execution, programs compactness, hardware simplicity and high execution speed. Expand
Queue processor architecture for novel queue computing paradigm based on produced order scheme
TLDR
This work proposes a novel produced order parallel queue processor architecture that uses a FIFO queue registers instead of random access registers to store intermediate results and shows that this feature has a profound implication in the areas of parallel execution, programs compactness, hardware simplicity and high execution speed. Expand
An Efficient Dynamic Switching Mechanism (DSM) for Hybrid Processor Architecture
TLDR
This work introduces the concept of a dynamic switching mechanism (DSM), which supports multi-instruction set execution models in a single and simple processor core for a novel queue execution model and a well-known stack based execution model. Expand
On the Design of a Register Queue Based Processor Architecture (FaRM-rq)
TLDR
A processor architecture that supports multi instructions set through run time functional assignment algorithm (RUNFA) and the novel FQM fundamentals and the principles underlying the architecture are presented. Expand
Theoretical Evaluation of Simultaneous Multithreading Para Ilel Queue Processor Architecture
In this paper, we describe abstraction of Simultaneous Multithreading Parallel Queue Processor (SMT-PQP) architecture. SMT-PQP is based on the queue calculation model. SMT-PQP can provide bothExpand
High-Level Modeling and FPGA Prototyping of Produced Order Parallel Queue Processor Core
TLDR
This paper has created the Synthesizable model of a produced order parallel queue processor core for the integer subset parallel Queue architecture and shows how to perform prototyping and optimizations to fully exploit the capabilities of the prototyped Queue processor core, while maintaining a common source base. Expand
A GCC-based Compiler for the Queue Register Processor (QRP-GCC)
Queue processors are a novel alternative of superscalar processors designed for the execution of highly parallel programs. The queue processor uses a first-in-first-out data structure for expressionExpand
QJAVAC: Java Compiler Design for High Parallelism Queue Java Byte Code
TLDR
The implementation and the evaluation of a Queue-Java compiler (QJAVAC) is described, which is a part of whole research project at the laboratory, for high-level parallelism QueueJava bytecodes without too much need for parallelism scheduling. Expand
Research on Adaptive Computing
ASL focuses on research and education of new methodologies and novel architectures for current and emerging technologies, and microelectronic devices. These devices form the core technology forExpand
Adaptive Systems Research
The main focuses of the Adaptive Systems Laboratory are mainly on research and education of new methodologies and novel architectures for current and emerging technologies, and microelectronicExpand
...
1
2
...

References

SHOWING 1-10 OF 22 REFERENCES
Design of a superscalar processor based on queue machine computation model
  • S. Okamoto, H. Suzuki, A. Maeda, M. Sowa
  • Computer Science
  • 1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)
  • 1999
TLDR
This paper describes a design of superscalar processor using this computation model, an evaluation scheme for expression trees, in which the input operands of operations are taken from head of a queue, and its result is put onto tail of the same queue. Expand
The microarchitecture of superscalar processors
TLDR
The general problem solved by superscalar processors: converting an ostensibly sequential program into a more parallel one is discussed and the principles underlying this process, and the constraints that must be met, are discussed. Expand
Allowing for ILP in an embedded Java processor
TLDR
A fill unit that stores decoded bytecodes into a decoded Bytecode cache is proposed that improves the fetch and decode bandwidth of Java processors by 2 to 3 times and a stack disambiguation technique that allows elimination of false dependencies between different types of stack: accesses is proposed. Expand
Instruction Issue Logic for High-Performance Interruptible, Multiple Functional Unit, Pipelines Computers
  • G. Sohi
  • Computer Science
  • IEEE Trans. Computers
  • 1990
TLDR
Simulation studies show that by resolving dependencies the proposed mechanism is able to obtain a significant speedup over a simple instruction issue mechanism as well as implement precise interrupts. Expand
Processor architecture - from dataflow to superscalar and beyond
TLDR
This chapter discusses the RISC Movement in Processor Architecture, which led to the creation of the CISC Processors, and its applications, including the Intel Pentium, AMD, and Apple PowerPC families. Expand
Register windows vs. register allocation
TLDR
By combining profiling, instrumentation, and in-line simulation, this work measured the effectiveness of several register management schemes, including compile-time and link-time schemes for allocating registers, and register window schemes using fixed-size or variable-sized windows. Expand
Data Flow on Queue Machines, 12th Int
  • IEEE Symposium on Computer Architecture
  • 1985
FARM-Queue Mode: On a Practical Queue Execution model
  • Proceedings of the Int. Conf. on Circuits and Systems, Computers and Communications,
  • 2001
Sowa: FARM-Queue Mode: On a Practical Queue Execution model
  • Proceedings of the Int. Conf. on Circuits and Systems, Computers and Communications
  • 2001
Fundamental of Queue machine, The Univ. of Electro-Communications, Sowa Laboratory
  • Fundamental of Queue machine, The Univ. of Electro-Communications, Sowa Laboratory
  • 2000
...
1
2
3
...