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
Demo Data from EDBT 2026 / reviewers in the wild / expert

J. Milewski

dblp:15/1711 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1983
—ORCID · unresolved

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1

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
1 paper
Processor architecture and microarchitecture · 87% Parallel and multicore computing · 13%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
dataflow architecture		 0.011983
A Data Driven System Based on a Microprogrammed Processor Module · ISCA 1983
Processor architecture and microarchitecture › microprogramming
microprogrammable processor		 0.011983
A Data Driven System Based on a Microprogrammed Processor Module · ISCA 1983

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

microprogramming · 0.0data flow graph · 0.0
YearPublicationVenuePosition
1983 A Data Driven System Based on a Microprogrammed Processor Module
abstract
A hardware approach to the design of data driven computers using a microprogrammed processor as a building block is proposed. The data driven computer is a network of processors virtually implementing the data flow program graph. The flexibility of microprogramming provides a wide variety of possible implementations for the fixed data driven network structure. Due to the proposed organization of communication the network is deadlock-free.
R. W. Marczynski, J. Milewski
 ISCA2