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

Stephen L. Hary

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

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

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 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
1 paper
Parallel and multicore computing · 54% Processor architecture and microarchitecture · 23% Interconnection networks and networks-on-chip · 23%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip
network contention		 0.011999
Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution · IEEE Trans. Parallel Distributed Syst. 1999
Processor architecture and microarchitecture › pipelining
pipelined execution		 0.011999
Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution · IEEE Trans. Parallel Distributed Syst. 1999
Parallel and multicore computing
task scheduling		 0.011999
Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution · IEEE Trans. Parallel Distributed Syst. 1999
Parallel and multicore computing › task scheduling
throughput-constrained scheduling		 0.011999
Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution · IEEE Trans. Parallel Distributed Syst. 1999
Parallel and multicore computing
multiprocessor system		 0.011999
Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution · IEEE Trans. Parallel Distributed Syst. 1999

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

recursive mincut bipartitioning · 0.0preclustering · 0.0iterative improvement · 0.0
YearPublicationVenuePosition
1999 Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution
abstract
The problem of scheduling directed acyclic task flow graphs to multiprocessor systems using point-to-point networks is examined. An environment where the application has a strict throughput requirement is assumed. Pipelined parallelism is used to meet the throughput requirement. Communication and computation are completely overlapped. Each task and message has a periodic rate and deadline equal to the throughput requirement. A heuristic procedure based on preclustering, recursive mincut bipartitioning, and iterative improvement is proposed to reduce the maximum contention due to communication in the network, increasing the likelihood that messages meet their deadlines. The task assignment procedure takes into account the topology of the multiprocessor system and the distance between communicating tasks.
Stephen L. Hary, Füsun Özgüner
 IEEE Trans. Parallel Distributed Syst.1
1998 Offline real-time channel establishment in packet-switched networks
Stephen L. Hary, Shobana Balakrishnan, Füsun Özgüner
 Comput. Commun.1