20 Hits in 20.9 sec

Random Quantum Allocation: A new approach to waiting time distributions for M/M/N processor sharing queues [chapter]

Jens Braband, Rolf Schaßberger
1993 Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen  
This approach can be used for the numerical approximation of waiting and response time distributions for processor sharing queues.  ...  These queues are approximated by sequences of models featuring a new natural discipline called Random Quantum Allocation (RQA) operating in discrete time.  ...  Our answer is the Random Quantum Allocation (RQA) model, which in contrast to the RR model gives up the ordering of the customers in the queue.  ... 
doi:10.1007/978-3-642-78495-8_11 dblp:conf/mmb/BrabandS93 fatcat:v4ujwtpmbfeovdb75ykdk6vf4m

Page 6168 of Mathematical Reviews Vol. , Issue 96j [page]

1996 Mathematical Reviews  
, Jens Waiting time distributions for closed M/M/N processor sharing queues.  ...  The actual computation of waiting time distribution for the model is accomplished by two independent methods, namely the random quantum allocation (RQA) approach and the numerical inversion of the LST.  ... 

Uncovering CPU load balancing policies with harmony

Joseph T. Meehean, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Miron Livny
2013 Proceedings of the ACM International Conference on Computing Frontiers - CF '13  
We introduce Harmony, a system for extracting the multiprocessor scheduling policies from commodity operating systems.  ...  Our analysis uncovers the strengths and weaknesses of each of these schedulers, and more generally shows how to utilize Harmony to perform detailed analyses of complex scheduling systems.  ...  a busy target would instead be represented as [m, m, m, n], where m > n.  ... 
doi:10.1145/2482767.2482784 dblp:conf/cf/MeeheanAAL13 fatcat:bpcknrs3mfe4behb5mljx4t7my

Utility Accrual Dynamic Routing in Real-Time Parallel Systems

Mehdi Kargahi, Ali Movaghar
2010 IEEE Transactions on Parallel and Distributed Systems  
MEU is compared with some well-known Dynamic Routing (DR) policies for different TUF shapes and both cases of homogeneous and heterogeneous processors of a two-queue system.  ...  In this paper, we propose an exact analytical solution for performance evaluation of dynamic policies used for routing of TUF-constrained Firm Real-Time (FRT) jobs among parallel single-processor queues  ...  ACKNOWLEDGMENT The authors wish to thank anonymous referees for their valuable comments and careful review of the paper.  ... 
doi:10.1109/tpds.2010.50 fatcat:t4iop2tn7zhxzewhi3b36avvqm

Workflow models for heterogeneous distributed systems

Iacopo Colonnelli, Marco Aldinucci
2022 Zenodo  
In addition, it introduces computational notebooks as a high-level and user-friendly interface to this new kind of workflow, aiming to flatten the learning curve and improve the adoption of such methodology  ...  First, it defines a novel methodology for distributed modular applications, allowing topology-aware scheduling and data management while separating business logic, data dependencies, parallel patterns  ...  Acknowledgements 1.4 Funding This work has been partially supported by the DeepHealth project 3 , "Deep-Learning and HPC to Boost Biomedical Applications for Health" which has received funding from the  ... 
doi:10.5281/zenodo.7135484 fatcat:hx2ayiku5nadblgj6nlmhplmd4

Performance Modeling and Analysis of Communication Networks. A Lecture Note [article]

Phuoc Tran-Gia, Tobias Hoßfeld
, Kleinrock's result, results for continuous-time GI/GI/1 delay systems, Kingman's approximations of mean waiting times. • Chapter 6 "Discrete-time Models and Analysis": analysis of idle times, busy times  ...  , interdeparture times of discrete-time GI/GI/1 systems, distributional Little's law for queue size derivation of GI/GI/1. • Chapter 7 "Advanced Models and Applications": video streaming QoS and QoE (M  ...  waiting time for customers who have to wait we consider only the waiting stage (the queue): System II (only waiting customers): waiting queue of the M/M/n system • mean arrival rate λ .16) Mean waiting  ... 
doi:10.25972/wup-978-3-95826-153-2 fatcat:uioyzlzfzzfj7pmyjyexfeijou

Datacenter Architectures for the Microservices Era [article]

Seyedamirhossein Mirhosseininiri, University, My
First, in chapter III, I characterize the tail latency behavior of microservices and provide general guidelines for optimizing computer systems from a queuing perspective to minimize tail latency.  ...  Queuing is a major contributor to end-to-end tail latency, whe [...]  ...  waiting for new tasks to arrive.  ... 
doi:10.7302/1405 fatcat:bgtlhrc4dbagrayj5cawxxaopi

Scalable Task Schedulers for Many-Core Architectures

Anuj Pathania
This thesis develops schedulers for many-cores with different optimization objectives.  ...  The proposed schedulers are designed to be scale up as the number of cores in many-cores increase while continuing to provide guarantees on the quality of the schedule.  ...  Unfortunately, with the reduction in size of a transistor with introduction of every new technology node the leakage power of a processor continued to rise due to quantum effects such as quantum tunneling  ... 
doi:10.5445/ir/1000082991 fatcat:uw4qombbqjelvpw7kiycy7xlwu

A Foreground-Background queueing model with speed or capacity modulation [article]

Andrea Marin, Isi Mitrani
Job service times have a two-phase Coxian distribution and the second phase is given lower priority than the first.  ...  The models studied in the steady state involve two queues which are served either by a single server whose speed depends on the number of jobs present, or by several parallel servers whose number may be  ...  The M/M/n model with two preemptive priority queues was studied by Mitrani and King [18] , by Gail at al. [8] and by Kao and Narayanan [12] .  ... 
doi:10.48550/arxiv.2112.01058 fatcat:p5rsqk2pcjbqba23fla4fvshmu

Proceedings of the Seminars Future Internet (FI) and Innovative Internet Technologies and Mobile Communication (IITM), Summer Semester 2017 [article]

Georg Carle, Daniel Raumer, Lukas Schwaighofer, Chair Of Network Architectures
The authors do not provide a notation for their queueing system, but given from the information in the text, it boils down to a M/M/n queue for the entire router.  ...  Mayer et al [14] show this figure, but finally model only the CPU as an M/M/n queue.  ... 
doi:10.2313/net-2017-09-1 fatcat:qtxz2tweurbszpmvspmsek3bsq

Performance engineering of data-intensive applications

Arya Mazaheri
We propose new hardware-independent metrics to characterize thread communication and provide suggestions for applying appropriate optimizations on a specific code region.  ...  Our findings show that the data shared between a pair of threads should be reused with a reasonably short intervals to preserve data locality, yet existing profilers neglect them and mainly report the  ...  We selected Winograd convolutions with m ∈ {mN|2 ≤ m ≤ 10} and r ∈ {3, 5, 7}. The results are given in Figures 4.9a-4.9c.  ... 
doi:10.26083/tuprints-00021078 fatcat:nskwgb2vxvew7egtrzwlzebiri

FUTURE COMPUTING 2011 Editors FUTURE COMPUTING 2011 Foreword FUTURE COMPUTING 2011 Committee FUTURE COMPUTING Advisory Chairs FUTURE COMPUTING 2011 Technical Program Committee

Kendall Nygard, Pascal Lorenz, Miriam Capretz, Hiroyuki Sato, Cristina Seceleanu, Cristina Seceleanu, Mälardalen University, Sweden Sato, Miriam Capretz, Marek Druzdzel, Radu Calinescu, Miriam Capretz (+23 others)
2011 The Third International Conference on Future Computational Technologies and Applications   unpublished
We are grateful to the members of the FUTURE COMPUTING 2011 organizing committee for their help in handling the logistics and for their work to make this professional meeting a success.  ...  We also kindly thank all the authors who dedicated much of their time and efforts to contribute to FUTURE COMPUTING 2011.  ...  ACKNOWLEDGEMENT The first author thanks the Japan Society for Promotion of Science for its support.  ... 


Massimo Villari, Yong Lee, Wolf Zimmermann
2011 The Second International Conference on Cloud Computing, GRIDs, and Virtualization   unpublished
This allows IARIA to give articles increased visibility via distribution, inclusion in libraries, and arrangements for submission to indexes.  ...  The copyright release is a transfer of publication rights, which allows IARIA and its partners to drive the dissemination of the published material.  ...  Without quanta's re-execution and quantum size no less than 32K, the DCSM generates overheads less than 3x. With a carefully chosen quantum size, the DCSM is supposed to have acceptable overheads.  ... 

OASIcs, Volume 16, MEMICS'10, Complete Volume [article]

Ludek Matyska, Michal Kozubek, Tomáš Vojnar, Pavel Zemcík, David Antos
We would also like to thank the anonymous reviewers for their valuable comments. Acknowledgements  ...  Jan Křetínský is a holder of Brno PhD Talent Financial Aid. Acknowledgements This research was supported by the grants of MPO Czech Republic FR-TI1/038 and by the Research Plan MSM No. 0021630528.  ...  We write ϕ R ψ to denote ∀M ∈ ϕ ∃N ∈ ψ ∀n ∈ N ∃m ∈ M : (m, n) ∈ R Note that if we take R = id, ϕ id ψ if and only if ϕ ⇒ ψ (i.e. ϕ ⊆ ψ ).  ... 
doi:10.4230/oasics.memics.2010 fatcat:hufnlt7gu5b4nocfjdcbkhylcy

Online) International Journal of Network Security is published both in traditional paper form (ISSN 1816-353X) and in Internet

Min-Shiang Hwang, Shu-Fen Chiou, Chia-Chun Wu, Cheng-Yi Yang, Ajith Abraham, Korea, Wael Adi, Iqbal Sheikh, Ahamed, Vijay Atluri, Mauro Barni, Andrew Blyth (+77 others)
2017 International Journal of Network Security   unpublished
This scheme firstly employed Wang and Su's sharing scheme to share a secret image into n shadows.  ...  A secret image sharing with deep-steganography and two-stage authentication based on matrix encoding is proposed.  ...  In Acknowledgement The authors would like to thank the anonymous reviewers for their useful comments.  ... 
« Previous Showing results 1 — 15 out of 20 results