......The main memory (dynamic RAM) system is a major limiter of computer system performance. In modern processors, which are overwhelmingly multicore (or multithreaded), the concurrently executing threads share the DRAM system, and different threads running on different cores can delay each other through resource contention. One thread’s memory requests can cause DRAM bank conflicts, row-buffe...

CASSCF/MRCI/aug-cc-pVQZ~no g! and RCCSD~T!/aug-cc-pVQZ potential energy functions were reported for the à B1 and X̃ A1 states of CF2 , respectively. Vibrational wave functions of the symmetric stretching and bending modes of the two states of CF2 were obtained in variational calculations, employing Watson’s Hamiltonian for a nonlinear molecule and anharmonic vibrational wave functions expressed ...

A celebrated theorem of Burke's asserts that the Poisson process is a fixed point for a stable exponential single server queue; that is, when the arrival process is Poisson, the equilibrium departure process is Poisson of the same rate. This paper considers the following question: Do fixed points exist for queues which dispense i.i.d. services of finite mean, but otherwise of arbitrary distribu...

BlueGene/L is a massively parallel cellular architecture system with a toroidal interconnect. Cellular architectures with a toroidal interconnect are effective at producing highly scalable computing systems, but typically require job partitions to be both rectangular and contiguous. These restrictions introduce fragmentation issues that affect the utilization of the system and the wait time and...

Parallel space-sharing job scheduling algorithms play an indispensible role in efficient allocation of processors of PC-cluster to the competing jobs to achieve one of the performance objective(s) viz. minimized mean response time (MRT), minimized average bounded slowdown or maximized throughput. Traditional performance modeling and evaluation studies of parallel spacesharing job scheduling alg...

In this paper, we propose a solution to the problem of guaranteed time slot allocation in cluster-tree WSNs. Our design uses the so-called Network Utility Maximization (NUM) approach as far as we aim to provide a fair distribution of the available resources. From the point of view of implementation, we extend here the authors' proposed Coupled-Decompositions Method (CDM) in order to compute the...

The N-System with independent Poisson arrivals and exponential server-dependent service times under first come first served and assign to longest idle server policy has explicit steady state distribution. We scale the arrival and the number of servers simultaneously, and obtain the fluid and central limit approximation for the steady state. This is the first step towards exploring the many serv...

Motivated by queues with multi-type servers and multi-type customers, we consider an infinite sequence of items of types C = {c1, . . . , cI}, and another infinite sequence of items of types S = {s1, . . . , sJ}, and a bipartite graph G of allowable matches between the types. We assume that the types of items in the two sequences are i.i.d. with given probability vectors α, β. Matching the two ...

We consider an infinite sequence of customers of types C = {1, 2, . . . , I } and an infinite sequence of servers of types S = {1, 2, . . . , J }, where a server of type j can serve a subset of customer types C(j) and where a customer of type i can be served by a subset of server types S(i). We assume that the types of customers and servers in the infinite sequences are random, independent, and...

We investigate some real time behaviour of a (discrete time) single server system with FCFS task scheduling. The main results deal with the probability distribution of a random variable SRD(T), which describes the time the system operates without violating a fixed task service time deadline T. The tree approach used for the derivation of our results is suitable for revisiting problems already s...