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 SIGIR 2026 / reviewers in the wild / expert

David Egozi

dblp:44/484 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

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

Systems, architecture and hardware · 2Software 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
Parallel and multicore computing · 50% Interconnection networks and networks-on-chip · 50%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
perfect shuffle		 0.011989
2-D SIMD Algorithms in the Perfect Shuffle Networks · ISCA 1989
Parallel and multicore computing › parallel algorithms › parallel algorithm design
SIMD algorithms		 0.011989
2-D SIMD Algorithms in the Perfect Shuffle Networks · ISCA 1989
YearPublicationVenuePosition
1992 2-D SIMD Algorithms for Perfect Shuffle Networks
Yosi Ben-Asher, David Egozi, Assaf Schuster
 J. Parallel Distributed Comput.2
1989 2-D SIMD Algorithms in the Perfect Shuffle Networks
abstract
This paper studies a set of basic algorithms for SIMD Perfect Shuffle networks. These algorithms where studied in several papers, but for the 1-D case, where the size of the problem N is the same as the number of processors P. For the 2-D case of N = L * P, studied by [GK-80] and [Kr-81], we improve several algorithms, achieving run time Ο(L + log P) rather than Ο(L * log P), as N exceeds P. We give non-trivial algorithms for the following 2-D operations: Row-Reduction, Parallel-Prefix, Transpose, Smoothing and Cartesian-Product.
Yosi Ben-Asher, David Egozi, Assaf Schuster
 ISCA2