CCL

Összesen 5 találat.
#/oldal:
Részletezés:
Rendezés:

1.

001-es BibID:BIBFORM094556
035-os BibID:(WoS)000654007400013 (Scopus)85107442396
Első szerző:Kuki Attila (informatikus, matematikus)
Cím:A contribution to scheduling jobs submitted by finite-sources in computational clusters / Kuki Attila, Bérczes Tamás, Tóth Ádám, Sztrik János
Dátum:2021
ISSN:1787-5021 1787-6117
Tárgyszavak:Műszaki tudományok Informatikai tudományok idegen nyelvű folyóiratközlemény hazai lapban
folyóiratcikk
Megjelenés:Annales Mathematicae et Informaticae. - 53 (2021), p. 201-218. -
További szerzők:Bérczes Tamás (1975-) (informatikus) Tóth Ádám (1990-) (mérnökinformatikus) Sztrik János (1953-) (informatikus, matematikus)
Pályázati támogatás:EFOP-3.6.3-VEKOP-16-2017-00002
EFOP
Internet cím:Szerző által megadott URL
DOI
Intézményi repozitóriumban (DEA) tárolt változat
Borító:

2.

001-es BibID:BIBFORM087240
035-os BibID:(WoS)000553268600005 (Scopus)85088517388
Első szerző:Kuki Attila (informatikus, matematikus)
Cím:Numerical analysis of finite source Markov retrial system with non-reliable server, collision, and impatient customers / Attila Kuki, Tamás Bérczes, Ádám Tóth, János Sztrik
Dátum:2020
ISSN:1787-5021 1787-6117
Megjegyzések:A retrial queuing system with a single server is investigated in this paper. The server is subject to random breakdowns. The number of customers is finite and collision may take place. A collision occurs when a customer arrives to the busy server. In case of a collision both customers involved in the collision are sent back to the orbit. From the orbit the customers retry their requests after a random waiting time. The server can be down due to a failure. During the failed period the arriving customers are sent to the orbit, as well. The novelty of this analysis is the impatient behaviour of the customers. A customer waiting in the orbit may leave it after a random waiting time. The requests of these customers will not be served. All the random variables included in the model construction are assumed to be exponentially distributed and independent from each other. The impatient property makes the model more complex, so the derivation of a direct algorithmic solution (which was provided for the non-impatient case) is difficult. For numerical calculations the MOSEL-2 tool can be used. This tool solves the Kolmogorov system equations, and from the resulting steady-state probabilities various system characteristics and performance measures can be calculated, i.e. mean response time, mean waiting time in the orbit, utilization of the server, probability of the unserved impatient requests. Principally the effect of the impatient property is investigated in these results, which are presented graphically, as well.
Tárgyszavak:Műszaki tudományok Informatikai tudományok konferenciacikk
folyóiratcikk
Megjelenés:Annales Mathematicae et Informaticae. - 51 (2020), p. 53-63. -
További szerzők:Bérczes Tamás (1975-) (informatikus) Tóth Ádám (1990-) (mérnökinformatikus) Sztrik János (1953-) (informatikus, matematikus)
Pályázati támogatás:EFOP-3.6.3-VEKOP-16-2017-00002
EFOP
Internet cím:Szerző által megadott URL
DOI
Intézményi repozitóriumban (DEA) tárolt változat
Szerző által megadott URL
Borító:

3.

001-es BibID:BIBFORM106155
035-os BibID:(WOS)000906815200011 (Scopus)85145717858
Első szerző:Sztrik János (informatikus, matematikus)
Cím:Sensitivity analysis of a single server finite-source retrial queueing system with two-way communication and catastrophic breakdown using simulation / János Sztrik, Ádám Tóth
Dátum:2022
ISSN:1787-5021 1787-6117
Megjegyzések:In this paper, a finite-source retrial queueing system with two- way communication is investigated with the help of a simulation program of own. If a randomly arriving request from the finite-source finds the single server idle its service starts immediately, otherwise, it joins an orbit from where it generates retrial/repeated calls after a random time. To increase the utilization of the server when it becomes idle after a random time an outgoing request is called for service from an infinity source. Upon its arrival if the server is busy, it goes to a buffer and when the server becomes idle again its service starts immediately. requests arriving from the finite-source and orbit are referred to as primary or incoming ones while requests called from the infinite source are referred to as secondary or outgoing requests, respectively. The service times of the primary and secondary requests are supposed to be random variables having different distributions. However, randomly catastrophic failures may happen to all the requests in the system, that is from the orbit, the service unit, and the buffer. In this case, the primary requests return to the finite-source, and the secondary ones are lost. The operation of the system is restored after a random time. Until the restoration is finished no arrivals and service take place in the system. All the above-mentioned times are supposed to be independent random variables. The novelty of this paper is to perform a sensitivity analysis of the failure and restoration/repair times on the main characteristics to illustrate the effect of different distributions having the same average and variance value. Our aim is to determine the distribution of the number of requests in the system, the average response time of an arbitrary primary request without successful service, also the average response time of an arbitrary and successfully served primary request, the total utilization of the service unit, or the probability that a primary request leaves the system without successful service because of a catastrophic event. Results are illustrated graphically obtained by our simulation program.
Tárgyszavak:Műszaki tudományok Informatikai tudományok idegen nyelvű folyóiratközlemény hazai lapban
folyóiratcikk
finite-source queueing
two-way communication
catastrophic failure
restoration
sensitivity analysis
characteristics
simulation
Megjelenés:Annales Mathematicae et Informaticae. - 56 (2022), p. 122-133. -
További szerzők:Tóth Ádám (1990-) (mérnökinformatikus)
Internet cím:Szerző által megadott URL
DOI
Intézményi repozitóriumban (DEA) tárolt változat
Borító:

4.

001-es BibID:BIBFORM116539
035-os BibID:(WoS)001104140800008 (Scopus)85176766242
Első szerző:Tóth Ádám (mérnökinformatikus)
Cím:Analysis of retrial queueing systems with two-way communication and impatient customers using simulation / Ádám Tóth, János Sztrik
Dátum:2023
ISSN:1787-5021 1787-6117
Megjegyzések:The aim of this research is to examine a finite-source retrial queueing system with two-way communication. The primary customers, who arrive from a finite-source following an exponential distribution, either receive service immediately if the service unit is available, or are redirected to the orbit and try again to reach the server after a random period. The system is unique in that when the server becomes idle, an outgoing call (secondary customer) is performed from the orbit or the source with varying parame-ters. Both primary and secondary customers have been serviced according to an exponential distribution but with different rates. Customers exhibit an impatience characteristic, which may lead to their departure before re-ceiving service if they spend a certain amount of time waiting for the service unit. This investigation conduct a sensitivity analysis on the system's performance measures by utilizing different distributions of the customers' retrial time in two separate cases. The findings of the analysis have been presented graphically for comparison purposes.
Tárgyszavak:Műszaki tudományok Informatikai tudományok idegen nyelvű folyóiratközlemény hazai lapban
folyóiratcikk
Finite-source queuing system
retrial queues
sensitivity analysis
simulation
two-way communication
Megjelenés:Annales Mathematicae et Informaticae. - 58 (2023), p. 160-169. -
További szerzők:Sztrik János (1953-) (informatikus, matematikus)
Internet cím:Szerző által megadott URL
DOI
Intézményi repozitóriumban (DEA) tárolt változat
Borító:

5.

001-es BibID:bibEBI00026091
035-os BibID:(WoS)000503370800015 (Scopus)85077847119
Első szerző:Tóth Ádám (mérnökinformatikus)
Cím:Optimization of hadoop cluster for analyzing large-scale sequence data in bioinformatics / Ádám Tóth, Ramin Karimi
Dátum:2019
ISSN:1787-5021 1787-6117
Megjegyzések:Unexpected growth of high-throughput sequencing platforms in recent years impacted virtually all areas of modern biology. However, the ability to produce data continues to outpace the ability to analyze them. Therefore, continuous efforts are also needed to improve bioinformatics applications for a better use of these research opportunities. Due to the complexity and diversity of metagenomics data, it has been a major challenging field of bioinformatics. Sequence-based identification methods such as using DNA signature (unique k-mer) are the most recent popular methods of real-time analysis of raw sequencing data. DNA signature discovery is compute-intensive and time-consuming. Hadoop, the application of parallel and distributed computing is one of the popular applications for the analysis of large scale data in bioinformatics. Optimization of the time-consumption and computational resource usages such as CPU consumption and memory usage are the main goals of this paper, along with the management of the Hadoop cluster nodes.
Tárgyszavak:Természettudományok Matematika- és számítástudományok idegen nyelvű folyóiratközlemény hazai lapban
folyóiratcikk
hadoop
optimization
next-Generation Sequencing
DNA signature
resource management
Megjelenés:Annales Mathematicae et Informaticae. - 50 (2019), p. 187-202. -
További szerzők:Karimi, Ramin (1975-) (programtervező matematikus)
Internet cím:Szerző által megadott URL
Intézményi repozitóriumban (DEA) tárolt változat
DOI
Borító:
Rekordok letöltése1