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

Venkatraman R. Iyer

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

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

Software engineering, systems software and programming languages · 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
Embedded and real-time systems · 33% Parallel and multicore computing · 33% Performance modeling and evaluation · 33%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems
distributed real-time systems
0.011989
Software Partitioning for Distributed, Sequential, Pipelined Applications · IEEE Trans. Software Eng. 1989
Performance modeling and evaluation › queueing models
queueing network model
0.011989
Software Partitioning for Distributed, Sequential, Pipelined Applications · IEEE Trans. Software Eng. 1989
Parallel and multicore computing
software partitioning
0.011989
Software Partitioning for Distributed, Sequential, Pipelined Applications · IEEE Trans. Software Eng. 1989

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

queueing network approximation · 0.0branch-and-bound · 0.0
YearPublicationVenuePosition
1989 Software Partitioning for Distributed, Sequential, Pipelined Applications
abstract
Investigation into real-time performance analysis and allocation of system resources to meet throughout and response time requirements has resulted in a proposed methodology for structuring software for real-time distributed systems. A queueing network model is used to estimate real-time performance for alternative software partitions, and those partitions which can satisfy user performance requirements while requiring minimal resources are determined. The current work is limited to feed-forward, pipelined structures. Partition blocks are formed by merging user-specified modules, and the required processing power to meet user requirements is then determined. A two queue model, representing module service and communications, is analyzed using queueing network approximation. The results show that the optimal solution set can be determined using a branch and bound approach. An example of the application of the results to a real system is provided. The results have been implemented as a user-interactive software structuring tool.
Venkatraman R. Iyer, Howard A. Sholl
IEEE Trans. Software Eng.1