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

Jason A. Moore

dblp:46/316 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
Interconnection networks and networks-on-chip · 67% Parallel and multicore computing · 33%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel scheduling
communication scheduling
0.011997
Generating an Efficient Broadcast Sequence Using Reflected Gray Codes · IEEE Trans. Parallel Distributed Syst. 1997
Interconnection networks and networks-on-chip
interprocessor communication
0.011997
Generating an Efficient Broadcast Sequence Using Reflected Gray Codes · IEEE Trans. Parallel Distributed Syst. 1997
Interconnection networks and networks-on-chip › broadcasting
one-to-all broadcasting
0.011997
Generating an Efficient Broadcast Sequence Using Reflected Gray Codes · IEEE Trans. Parallel Distributed Syst. 1997
Coding theory › error-correcting codes › combinatorial coding theory
gray codes
0.011997
Generating an Efficient Broadcast Sequence Using Reflected Gray Codes · IEEE Trans. Parallel Distributed Syst. 1997

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

reflected gray code ordering · 0.0binomial tree · 0.0
YearPublicationVenuePosition
2014 A human cognition framework for information visualization
Robert Earl Patterson, Leslie M. Blaha, Georges G. Grinstein, Kristen Liggett, David E. Kaveney, Kathleen C. Sheldon, Paul R. Havig, Jason A. Moore
Comput. Graph.8
1997 Enhancing Disk-Directed I/O for Fine-Grained Redistribution of File Data
Jason A. Moore, Michael J. Quinn
Parallel Comput.1
1997 Generating an Efficient Broadcast Sequence Using Reflected Gray Codes
abstract
One-to-all broadcast is frequently implemented on multicomputers using a binomial tree communication pattern. The source processor, at the root of the broadcast tree, completes the broadcast before the processors at the leaves of the tree. This imbalance can degrade performance when a data-parallel algorithm requires a series of broadcasts from different source processors. In this paper, we show that using a reflected Gray code to order broadcasts minimizes the communication time.
Jason A. Moore, Michael J. Quinn
IEEE Trans. Parallel Distributed Syst.1