An Approach to Forecast Queue Time in Adaptive Scheduling: How to Mediate System Efficiency and Users Satisfaction

Abstract

The minimisation of the total cost of ownership is hard to be faced by the owners of large scale computing systems, without affecting negatively the quality of service for the users. Modern datacenters, often included The minimisation of the total cost of ownership is hard to be faced by the owners of large scale computing systems, without affecting negatively the quality of service for the users. Modern datacenters, often included in distributed environments, appear to be “elastic”, i.e., they are able to shrink or enlarge the number of local physical or virtual resources, also by recruiting them from private/public clouds. This increases the degree of dynamicity, making the infrastructure management more and more complex. Here, we report some advances in the realisation of an adaptive scheduling controller (ASC) which, by interacting with the datacenter resource manager, allows an effective and an efficient usage of resources. In particular, we focus on the mathematical formalisation of the ASC’s kernel that allows to dynamically configure, in a suitable way, the datacenter resources manager. The described formalisation is based on a probabilistic approach that, starting from both a hystorical resources usage and on the actual users request of the datacenter resources, identifies a suitable probability distribution for queue time with the aim to perform a short term forecasting. The case study is the SCoPE datacenter at the University of Naples Federico II

Toward a multilevel scalable parallel Zielonka's algorithm for solving parity games

“…Hyper‐Threading Technology allows one physical processor package to be perceived as two separate logical processors within the operating system. However, Hyper‐Threading Technology cannot have performance expectations equivalent to that of multiprocessing where all the processor resources are replicated 58 . Measured performance on common server application benchmarks for this technology shows performance gains of up to r = 30 % .…”

“…Observe that when , Equation () provide the classical definition of speed‐up as defined in References 56 and 57. It is worth noting that also provide the number of logical computing elements in Hyper‐Threading Technology (see Tables 5 and 6 for results). Example : Table 2 shows the percentage of the Attractor execution time with respect the total execution time of Algorithm 2 for game of size up to 20 K .Table 3 shows values of computed starting from values of Attr provided in Table 2 where r = 30 % 58 Sc1,qf and , and , obtained by using Propositions 2 and 3.…”

Angara interconnect makes GPU-based Desmos supercomputer an efficient tool for molecular dynamics calculations

“…There are attempts of statistical analysis of supercomputers operation (e.g. see Barone et al, 2017; Mamaeva and Voevodin, 2017).…”

Vessel to shore data movement through the Internet of Floating Things: A microservice platform at the edge

“…This way, we improved the data access at the cost of rebuilding the Signal K update messages when needed. We improved the data decryption, verification, and database storage operations by integrating a local schedule component based on a message queue enabling the events and providing cloud scalability 20 …”