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

Johan B. Swenker

dblp:34/3189 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 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
Parallel and multicore computing · 50% Hardware accelerators and domain-specific architectures · 50%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel algorithms › parallel algorithm design
systolic algorithms
0.011989
On the design of some systolic algorithms · J. ACM 1989
Hardware accelerators and domain-specific architectures
systolic array
0.011989
On the design of some systolic algorithms · J. ACM 1989

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

sequential programming techniques · 0.0local communication · 0.0
YearPublicationVenuePosition
1989 On the design of some systolic algorithms
abstract
The design of systolic algorithms is discussed, that is, algorithms that may efficiently be executed by a synchronous array of cells that perform local communications only. Systolic algorithms are designed through techniques developed in the context of sequential programming. Heuristics are given that guide the programmer in the design of a variety of efficient solutions.
Jan L. A. van de Snepscheut, Johan B. Swenker
J. ACM2