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

Te-Yu Hsiung

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

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

Systems, architecture and hardware · 2

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 · 87% Interconnection networks and networks-on-chip · 13%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel scheduling
divisible load scheduling		 0.011994
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job · IEEE Trans. Computers 1994
Parallel and multicore computing
load balancing		 0.011994
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job · IEEE Trans. Computers 1994
Interconnection networks and networks-on-chip
network topology		 0.011994
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job · IEEE Trans. Computers 1994

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

equivalent processor aggregation · 0.0closed-form solution · 0.0
YearPublicationVenuePosition
1994 Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
abstract
Optimal load allocation for load sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with front-end processors or not so equipped. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are obtained. The performance of large symmetric tree networks is examined by aggregating the component links and processors into a single equivalent processor. This allows an easy examination of large tree networks. In addition, it becomes possible to find a closed form solution for the optimal amount of data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time.>
Sameer M. Bataineh, Te-Yu Hsiung, Thomas G. Robertazzi
 IEEE Trans. Computers2
1993 Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job
abstract
Optimal load allocation for load sharing a divisi ble job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with front-end processors or not so equipped. Closed form solutions for the minimum fin ish time and the optimal data allocation for each pro cessor are obtained. The performance of large sym metric tree networks is examined by aggregating the component links and processors into a single equiv alent processor. This allows an easy examination of large tree networks. In addition it becomes possible to find a closed form solution for the optimal amount of data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time.
Sameer M. Bataineh, Te-Yu Hsiung, Thomas G. Robertazzi
 ICPP (1)2