42 citations · 207 across the 76 of their papers we have counts for
17 papers · 1 filter
Caching Policies based on Object Sizes
Ridwanul Hasan Tanvir, George Kesidis
We evaluate eviction policies that consider the lengths of the objects being cached for different cache sizes (cost) and different workloads. Workloads include the Independent Refe…
Performance and Cost-Aware Cache Provisioning
Ridwanul Tanvir, George Kesidis
While traditional cache policy evaluations fix capacity - often at 0.1% of the dataset - and measure the resulting hit rate, practical edge-cloud deployments require balancing both…
Ten Ways in which Virtual Reality Differs from Video Streaming
Gustavo de Veciana, Sonia Fahmy, George Kesidis +1
Virtual Reality (VR) applications have a number of unique characteristics that set them apart from traditional video streaming. These characteristics have major implications on the…
GPU Cluster Scheduling for Network-Sensitive Deep Learning
Aakash Sharma, Vivek M. Bhasi, Sonali Singh +3
We propose a novel GPU-cluster scheduler for distributed DL (DDL) workloads that enables proximity based consolidation of GPU resources based on the DDL jobs' sensitivities to the…
Cluster Resource Management for Dynamic Workloads by Online Optimization
Nader Alfares, George Kesidis, Ata Fatahi Baarzi +1
Over the past ten years, many different approaches have been proposed for different aspects of the problem of resources management for long running, dynamic and diverse workloads s…
Age of Information for Small Buffer Systems
George Kesidis, Takis Konstantopoulos, Michael Zazanis
Consider a message processing system whose objective is to produce the most current information as measured by the quantity known as "age of information". We have argued in previou…
Age of information distribution under dynamic service preemption
George Kesidis, Takis Konstantopoulos, Michael A. Zazanis
Age of Information (AoI) has emerged as an important quality-of-service measure for applications that prioritize delivery of the freshest information, e.g., virtual or augmented re…
Age of information without service preemption
George Kesidis, Takis Konstantopoulos, Michael A. Zazanis
When designing a message transmission system, from the point of view of making sure that the information transmitted is as fresh as possible, two rules of thumb seem reasonable: us…
On a caching system with object sharing
George Kesidis, Nader Alfares, Xi Li +3
We consider a content-caching system thatis shared by a number of proxies. The cache could belocated in an edge-cloud datacenter and the proxies couldeach serve a large population…
The distribution of age-of-information performance measures for message processing systems
George Kesidis, Takis Konstantopoulos, Michael Zazanis
The idea behind the recently introduced "age of information" performance measure of a networked message processing system is that it indicates our knowledge regarding the "freshnes…
Overbooking Microservices in the Cloud
George Kesidis
We consider the problem of scheduling serverless-computing instances such as Amazon Lambda functions, or scheduling microservices within (privately held) virtual machines (VMs). In…
Heterogeneous MacroTasking (HeMT) for Parallel Processing in the Public Cloud
Yuquan Shan, George Kesidis, Bhuvan Urgaonkar +3
Using tiny, equal-sized tasks (Homogeneous microTasking, HomT) has long been regarded an effective way of load balancing in parallel computing systems. When combined with nodes pul…
Relative Age of Information: Maintaining Freshness while Considering the Most Recently Generated Information
George Kesidis, Takis Konstantopoulos, Michael Zazanis
A queueing system handling a sequence of message arrivals is considered where each message obsoletes all previous messages. The objective is to assess the freshness of the latest m…
Online Scheduling of Spark Workloads with Mesos using Different Fair Allocation Algorithms
Yuquan Shan, Aman Jain, George Kesidis +3
In the following, we present example illustrative and experimental results comparing fair schedulers allocating resources from multiple servers to distributed application framework…
Scheduling Distributed Resources in Heterogeneous Private Clouds
George Kesidis, Yuquan Shan, Yujia Wang +3
We first consider the static problem of allocating resources to ( i.e. , scheduling) multiple distributed application framework s, possibly with different priorities and server pre…
Stationary Distribution of a Generalized LRU-MRU Content Cache
George Kesidis
Many different caching mechanisms have been previously proposed, exploring different insertion and eviction policies and their performance individually and as part of caching netwo…
Network calculus for parallel processing
G. Kesidis, B. Urgaonkar, Y. Shan +2
In this note, we present preliminary results on the use of "network calculus" for parallel processing systems, specifically MapReduce.