Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Philip LeNir

dblp:09/2335 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Processor architecture and microarchitecture · 78% Memory systems · 17% Parallel and multicore computing · 5%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
instruction-level parallelism
0.021995
Design and Performance Evaluation of a Multithreaded Architecture · HPCA 1995
Exploiting instruction-level parallelism: the multithreaded approach · MICRO 1992
Processor architecture and microarchitecture
multithreading
0.021995
Design and Performance Evaluation of a Multithreaded Architecture · HPCA 1995
Exploiting instruction-level parallelism: the multithreaded approach · MICRO 1992
Memory systems › cache
cache organization
0.011995
Design and Performance Evaluation of a Multithreaded Architecture · HPCA 1995
Processor architecture and microarchitecture › instruction scheduling
dynamic instruction scheduling
0.011992
Exploiting instruction-level parallelism: the multithreaded approach · MICRO 1992
Processor architecture and microarchitecture › instruction-level parallelism
superscalar and VLIW processors
0.011992
Exploiting instruction-level parallelism: the multithreaded approach · MICRO 1992
Parallel and multicore computing
thread-level parallelism
0.011995
Design and Performance Evaluation of a Multithreaded Architecture · HPCA 1995

Methods — techniques the papers use, named apart from their topics

discrete-event simulation · 0.0simulation · 0.0
YearPublicationVenuePosition
1995 Design and Performance Evaluation of a Multithreaded Architecture
abstract
Multithreaded architectures have the ability to tolerate long memory latencies and unpredictable synchronization delays. We propose a multithreaded architecture that is capable of exploiting both coarse-grain parallelism, and fine-grain instruction level parallelism in a program. Instruction-level parallelism is exploited by grouping instructions from a number of active threads at runtime. The architecture supports multiple resident activations to improve the extent of locality exploited. Further, a distributed data structure cache organization is proposed to reduce both the network: traffic and the latency in accessing remote locations. Initial performance evaluation using discrete-event simulation indicates that the architecture is capable of achieving very high processor throughput. The introduction of the data structure cache reduces the network latency significantly. The impact of various cache organizations on the performance of the architecture is also discussed in this paper.>
R. Govindarajan, Shashank S. Nemawarkar, Philip LeNir
HPCA3
1992 Exploiting instruction-level parallelism: the multithreaded approach
abstract
The main challenge in the field of Very Large Instruction Word (VLIW) and superscalar architectures is ezploiting as much instruction-level parallelism as possible. In this paper an ezecution model which uses multiple instruction sequences and eztracts instruction-level parallelism at runtime from a set of enabled threads has been presented. A new multi-ring architecture has been proposed to support the ezeculion model. The multithreaded architecture features (i) large resident activations to improve program and data locality, (ii) a novel high-speed buger organization which ensures zero load/store stalls for the local variables of an activation, and (iii) a dynamic instruction scheduler that groups operations from multiple threads for ezecution. Initial performance evaluation studies predict that the proposed architecture is capable of ezecuting 7 concurrent operations per cycle with 8 ezecution pipes and 6 rings.
Philip LeNir, R. Govindarajan, Shashank S. Nemawarkar
MICRO1