Related papers: Relaxation Phenomena in Supercomputer Jobs
The computation of a cyber-physical system's reaction to a stimulus typically involves the execution of several tasks. The delay between stimulus and reaction thus depends on the interaction of these tasks and is subject to timing…
Extreme events can come either from point processes, when the size or energy of the events is above a certain threshold, or from time series, when the intensity of a signal surpasses a threshold value. We are particularly concerned by the…
We consider a class of kinetically constrained interacting particle systems on ${\mathbb{Z}}^d$ which play a key role in several heuristic qualitative and quantitative approaches to describe the complex behavior of glassy dynamics. With…
Scheduling is the task of assigning a set of scarce resources distributed over time to a set of agents, who typically have preferences about the assignments they would like to get. Due to the constrained nature of these problems, satisfying…
We consider the classic problem of scheduling jobs with precedence constraints on identical machines to minimize makespan, in the presence of communication delays. In this setting, denoted by $\mathsf{P} \mid \mathsf{prec}, c \mid…
The fidelity of operations on a solid-state quantum processor is fundamentally bounded by environmental decoherence. Characterizing environmental fluctuations is challenging because the acquisition time of nonadaptive experimental protocols…
Work sharing and work stealing are two scheduling paradigms to redistribute work when performing distributed computations. In work sharing, processors attempt to migrate pending jobs to other processors in the hope of reducing response…
The problem of the equivalence of the spherical and mean spherical models, which has been thoroughly studied and understood in equilibrium, is considered anew from the dynamical point of view during the time evolution following a quench…
We consider shared-object systems that require their threads to fulfill the system jobs by first acquiring sequentially the objects needed for the jobs and then holding on to them until the job completion. Such systems are in the core of a…
We consider the problem of scheduling on a single processor a given set of n jobs. Each job j has a workload w_j and a release time r_j. The processor can vary its speed and hibernate to reduce energy consumption. In a schedule minimizing…
The non-exponential relaxation is shown to result from subordination by inverse tempered \alpha-stable processes. The main feature of tempered \alpha-stable processes is a finiteness of their moments, and the class of random processes…
We consider a computation offloading system where jobs are processed sequentially at a local server followed by a higher-capacity cloud server. The system offers two service modes, differing in how the processing is split between the…
We present results on dynamical processes that exhibit a stretched exponential relaxation. When the relaxation is a result of two competing exponential processes, the size of the system, although macroscopic, play a dominant role. There…
We use computer simulations to study the dynamics of a physical gel at high densities where gelation and the glass transition interfere. We report and provide detailed physical understanding of complex relaxation patterns for time…
The emergence of labor division in multi-agent system is analyzed by the method of statistical physics. Considering a system consists of N homogeneous agents. Their behaviors are determined by the returns from their production. Using the…
This work is motivated by the relaxation data for materials which exhibit a change of the relationship between the fractional power-law exponents when different relaxation peaks in their dielectric susceptibility are observed. Within the…
A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm cite{BKL75}, which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is…
We consider a computing system where a master processor assigns tasks for execution to worker processors through the Internet. We model the workers decision of whether to comply (compute the task) or not (return a bogus result to save the…
Multicore shared cache processors pose a challenge for designers of embedded systems who try to achieve minimal and predictable execution time of workloads consisting of several jobs. To address this challenge the cache is statically…
Considering asynchronous shared memory systems in which any number of processes may crash, this work identifies and formally defines relaxations of queues and stacks that can be non-blocking or wait-free while being implemented using only…