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

János Sztrik

dblp:35/5983 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2013
0000-0002-5303-818XORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 first-authorComputer networks · 2Artificial intelligence and machine learning · 1Software 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
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
asymptotic analysis
0.011991
Asymptotic Analysis of a Heterogeneous Multiprocessor System in a Randomly Changing Environment · IEEE Trans. Software Eng. 1991
Performance modeling and evaluation › parallel system performance
multiprocessor performance
0.011991
Asymptotic Analysis of a Heterogeneous Multiprocessor System in a Randomly Changing Environment · IEEE Trans. Software Eng. 1991
Performance modeling and evaluation
queueing models
0.011991
Asymptotic Analysis of a Heterogeneous Multiprocessor System in a Randomly Changing Environment · IEEE Trans. Software Eng. 1991

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

queueing theory · 0.0asymptotic analysis · 0.0
YearPublicationVenuePosition
2013 A Fluid Limit for the Engset Model - An Application to Retrial Queues
abstract
We represent the classical Engset-loss model by the stochastic process counting the number of customers in the system. A fluid limit for this process is established for all the possible values of the various parameters of the system, as the number of servers tends to infinity along with the number of sources. Our results are derived through a semi-martingale decomposition method. A numerical application is provided to illustrate these results. Then, we represent a finite-source retrial queue considering in addition the number of sources in orbit. Finally, we extend the fluid limit results to a retrial queueing system, discussing different cases.
Stylianos Georgiadis, Pascal Moyal, Tamás Bérczes, János Sztrik
ICORES4
2009 Finite-source M/M/S retrial queue with search for balking and impatient customers from the orbit
Patrick Wüchner, János Sztrik, Hermann de Meer
Comput. Networks2
2001 CAC Algorithm Based on Advanced Round Robin Method for QoS Networks
abstract
In this paper a new traffic control method called advanced round robin (ARR) is presented. It is shown that ARR can provide both worst case and statistical quality of service guarantees without coupling cell loss and delay requirements. A related connection admission control algorithm with performance study is also presented. A comparative performance analysis of ARR using simulation was performed in different real scenarios. Results are compared to a reference system and to the simple round robin method.
Tamás Marosits, Sándor Molnár, János Sztrik
ISCC3
1993 Modelling of a Multiprocessor System in a Randomly Changing Environment
János Sztrik
Perform. Evaluation1
1991 Asymptotic Analysis of a Heterogeneous Multiprocessor System in a Randomly Changing Environment
abstract
An asymptotic queuing theoretic approach is proposed to analyze the performance of an FCFS (first-come, first-served) heterogeneous multiprocessor computer system with a single bus operating in a randomly changing environment. All stochastic times in the system are considered to be exponentially distributed and independent of the random environment, while the access and service rates of the processors are subject to random fluctuations. It is shown under the assumption of 'fast' arrivals that the busy period length of the bus converges weakly, under appropriate normalization, to an exponentially distributed random variable. As a consequence, main steady-state performance measures such as system throughput, mean delay time, expected waiting time, and mean number of active processors can be approximately determined. The reliability of the proposed method is validated by comparing the new approximations with known exact results.>
János Sztrik, Demetres D. Kouvatsos
IEEE Trans. Software Eng.1
1990 A Recursive Solution of a Queueing Model for a Multi-Terminal System Subject to Breakdowns
János Sztrik, T. Gál
Perform. Evaluation1