The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 1987 of Mathematical Reviews Vol. , Issue 2003C
[page]
2003
Mathematical Reviews
Preserved Fulltext
Parthasarathy (6-11TM; Chennai)
2003¢:60151 60K25 90B22
Economou, Antonis (GR-UATH; Athens)
An alternative model for queueing systems with single arrivals, batch services and customer coalescence. ...
Summary: “In this paper we consider a queueing system with single arrivals, batch services and customer coalescence and we use it as a building block for constructing queueing networks that incorporate ...
Page 5693 of Mathematical Reviews Vol. , Issue 97I
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
NJ);
Pinedo, Michael (1-CLMB-I; New York, NY):
Shaw, Dequan (1-GTE; Waltham, MA)
Networks of queues with batch services and customer coalescence. ...
When a service occurs at node /, if there are more than or equal to K; customers present, then K, of these customers coalesce into a single customer which leaves node j and may be routed elsewhere in the ...
Analysis of multiple-server polling systems by means of the power-series algorithm
1997
Communications in Statistics Stochastic Models
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We consider a polling model with multiple servers, each of which visits the queues according to its own service order table. ...
In this paper, we show how the model can be analyzed by the power-series algorithm (PSA), a tool for the numerical evaluation and optimization of the performance of a broad class of multi-queue models. ...
The class in question includes most single-queue systems, two-queue two-server systems with exhaustive service and exponential service times, as well as infinite-server systems with an arbitrary number ...
doi:10.1080/15326349708807430
fatcat:27p4tl7g25fz5j27g4qsknvlvy
Waiting-time approximations for multiple-server polling systems
1998
Performance evaluation (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Browne and Kella [12] consider a two-queue system with an infinite number of coupled servers, exhaustive service, and deterministic service times at one queue and general service times at the other. ...
Browne et al. [ 1 l] examine a completely symmetric two-queue system with an infinite number of coupled servers and deterministic service times. ...
Acknowledgements The authors would like to thank JPC Blanc and OJ Boxma for several valuable discussions and the anonymous referees for their useful suggestions. ...
doi:10.1016/s0166-5316(96)00063-6
fatcat:oajgguzudfeihovm4n44fmbwla
A discrete-time Geo[X]/G/1 retrial queue with control of admission
2005
Applied Mathematical Modelling
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper analyses a discrete-time Geo/G/1 retrial queue with batch arrivals in which individual arriving customers have a control of admission. ...
We also establish a stochastic decomposition property and prove that the continuous-time M/G/1 retrial queue with batch arrivals and control of admission can be approximated by our discrete-time system ...
Acknowledgments The authors thank the referee for his comments on an earlier version of this paper. This research is supported by the DGINV through the project BFM2002-02189. ...
doi:10.1016/j.apm.2005.02.005
fatcat:3wf2kp2slnh2bly4oleimdv33q
Model-based analytics for profiling workloads in virtual network functions
2017
2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a model-based analytics approach for profiling (virtual) network function (VNF) workloads that captures traffic burstiness, considering -and adding value to -hardware/software performance ...
towards an agile network. ...
ACKNOWLEDGMENT This work was supported by the INPUT (In-Network Programmability for next-generation personal cloUd service supporT) project, funded by the European Commission under the Horizon 2020 Programme ...
doi:10.1109/infcomw.2017.8116498
dblp:conf/infocom/BruschiDLP17
fatcat:aok3w6wolngl3kmbznqr52x5cy
Asymmetric inclusion process
2011
Physical Review E
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
The ASIP model establishes bridges between statistical physics and queueing theory as it represents a tandem array of queueing systems with (unlimited) batch service, and a tandem array of growth-collapse ...
state, and describe an iterative scheme for the computation of the PGF at steady state. ...
Consider a single service station with batch service. ...
doi:10.1103/physreve.84.041101
pmid:22181081
fatcat:dgqg7ozh6zdz5elhifpwfvkwyy
Perturbation analysis: the state of the art and research issues explained via the GI/G/1 queue
1989
Proceedings of the IEEE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The paper is written for a broad audience and n o prior knowledge of discrete event systems or queueing theory is assumed. ...
The aim of this paper is to use a simple Gl/G/I system to give an introduction to PA and illustrate the basic theoretical issues involved in this technique. ...
Glasserman and Gong [26] provide such an alternate representation for an M/G/I/K queue. ...
doi:10.1109/5.21075
fatcat:c3ol7qpctbakzc7446673z6mom
Energy Efficient Ethernet on MapReduce Clusters: Packet Coalescing To Improve 10GbE Links
2017
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Finally, we evaluate our recommendation for packet coalescing for 10GbE links using the energy-delay metric. This article is an extension of our previous work [1], which was published in ...
With our new analysis of how the static parameters of packet coalescing perform under different cluster loads we were able to cover both idle and heavy load periods that can exist on this type of environment ...
The large workload is closer to batch processing for big data applications [41] , and we engage the whole system using a single large job, with the number of map and of reduce tasks both equal to twice ...
doi:10.1109/tnet.2017.2707859
fatcat:uiqcm4r7iffohm25gpevqnm3hq
Stretch: Balancing QoS and Throughput for Colocated Server Workloads on SMT Cores
2019
2019 IEEE International Symposium on High Performance Computer Architecture (HPCA)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
When Stretch is enabled for latency-sensitive workloads operating below their peak load on an SMT core, co-running batch applications gain 13% of performance on average (30% max) over a baseline SMT colocation ...
This form of aggressive colocation is afforded by virtue of the fact that a latency-sensitive service operating below its peak load has significant slack in its response latency with respect to the QoS ...
ACKNOWLEDGEMENTS The authors thank Priyank Faldu, Cheng-Chieh Huang, Rakesh Kumar, Amna Shahab, Dmitrii Ustiugov and the anonymous reviewers for their helpful comments. ...
doi:10.1109/hpca.2019.00024
dblp:conf/hpca/MargaritovGGG19
fatcat:mc5fn7x2hncn3lu3tlh77c5pbu
A dynamic hybrid scheduling algorithm for heterogeneous asymmetric environments
2005
International Journal of Parallel, Emergent and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
I have been fortunate and privileged to work with her. I would like to express my sincere gratitude and best regards to Prof. Sajal K. Das for his advice and encouragement. ...
If anyone is looking for an example of a good advisor, let me especially recommend mine, Maria Cristina Pinotti. Prof. ...
This is solved by using batching of multiple information and handling the batched requests by a single transmission of data items. ...
doi:10.1080/17445760500094913
fatcat:dlatfsdkbngkxne2py22vr74dy
Performance Issues of Multimedia Applications
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
An extensive range of problems have been investigated in the last years from issues on how to efficiently store and retrieve continuous media information in large systems, to issues on how to efficiently ...
The dissemination of the Internet technologies, increasing communication bandwidth and processing speeds, and the growth in demand for multimedia information gave rise to a variety of applications. ...
Every new client that arrives within the bounds of this window and requests the stream s i is inserted in a waiting queue i.e., it is batched together with the client c k . ...
doi:10.1007/3-540-45798-4_16
fatcat:kmpyw2iyubds5blqridsst2nmq
Virtual Organization Clusters: Self-provisioned clouds on the grid
2010
Future generations computer systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Scott Duckworth and Nell Kennedy have provided exceptional assistance with the provisioning of networking and other services required to support our prototype systems, hardware and vendor advice, and assistance ...
As a grid computing architecture, VOCs are designed to be technology agnostic and are implementable by any combination of software and services that follows the Virtual Organization Cluster Model. ...
Even though additional jobs arrived in the queue while the VOC nodes were booting, all jobs from the first two batches had completed within 140 seconds. ...
doi:10.1016/j.future.2010.02.011
fatcat:x6nwjn3c5jhnbfcuzeexdkz22a
Bubble execution
2018
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our implementation enhances our JetScope service, for interactive workloads, deployed in production clusters at Microsoft. ...
, and execution orchestration. ...
The Microsoft Cosmos service supports a batch data preparation job service that uses a batch execution model. ...
doi:10.14778/3192965.3192967
fatcat:fll5r6p355hj5eagx6mrcxehfu
Efficient software packet processing on heterogeneous and asymmetric hardware architectures
2014
Proceedings of the tenth ACM/IEEE symposium on Architectures for networking and communications systems - ANCS '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Heterogeneous and asymmetric computing systems are composed by a set of different processing units, each with its own unique performance and energy characteristics. ...
In this paper, we propose an adaptive scheduling approach that supports heterogeneous and asymmetric hardware, tailored for network packet processing applications. ...
Acknowledgments This work was supported by the General Secretariat for Research and Technology in Greece with a Research Excellence grant. ...
doi:10.1145/2658260.2658265
dblp:conf/ancs/KoromilasVMI14
fatcat:vwthcmmhfbdgfg6rgzkbl5c5re
« Previous
Showing results 1 — 15 out of 287 results