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

George P. Engelberg

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

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

Systems, architecture and hardware · 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
Performance modeling and evaluation · 40% Electronic design automation · 20% Cloud and datacenter computing · 20%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
job scheduling
0.011980
Job Scheduling in a Single-Node Hierarchical Network for Process Control · IEEE Trans. Computers 1980
Embedded and real-time systems › industrial control systems
process control
0.011980
Job Scheduling in a Single-Node Hierarchical Network for Process Control · IEEE Trans. Computers 1980
Electronic design automation › high-level synthesis
scheduling
0.011980
Job Scheduling in a Single-Node Hierarchical Network for Process Control · IEEE Trans. Computers 1980
Performance modeling and evaluation
simulation
0.011980
Job Scheduling in a Single-Node Hierarchical Network for Process Control · IEEE Trans. Computers 1980
Performance modeling and evaluation
workload characterization
0.011980
Job Scheduling in a Single-Node Hierarchical Network for Process Control · IEEE Trans. Computers 1980

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

simulation · 0.0optimization procedure · 0.0
YearPublicationVenuePosition
1980 Job Scheduling in a Single-Node Hierarchical Network for Process Control
abstract
The operating characteristics of a typical single-node hierarchical element in a multiprocessor network such as might be used for process control are described, and the class of scheduling problems arising from the use of such a network is discussed and related to similar problems which have been reported in the literature. Two measures of system performance are then defined: the "settling time," defined as the maximum of the finishing times of all jobs when a set of jobs is initiated once in the network, and the "steady-state service," a related performance index for the case where jobs are initiated on a periodic basis. Finally, a simulation model is used to evaluate the operating characteristics of the hierarchical network using the two metrics in conjunction with several synthetic workloads; a general optimization procedure is shown to lead to values of scheduling parameters which are close to optimal even for network workloads with many degrees of freedom (i.e., when many computers are initiating jobs).
George P. Engelberg, James A. Howard, Duncan A. Mellichamp
IEEE Trans. Computers1