Marwan S. Sleiman

Learn More
In this paper we model the hierarchal nature of memory in order to examine the variance, and in general, all moments of the distribution of time memory access. The existence of an unbounded variance for the memory access time can lead to extremely long wait queues and a particular class of distributions that has this property is the power tailed(More)
As the modern computing environment expands memory hierarchy from CPU registers and local memory to network storage, the optimal goal of a computer architect becomes to design a memory hierarchy that maximizes the overall design of his machine with a minimal cost. This requires deciding on the number, speed and size of the hierarchical layers. As the gap(More)
In many parallel processing systems, particularly real-time systems, it is desirable for jobs to finish as close to a target time as possible. This work examines a method of controlling the variance of job completion times by dynamically allocating resources to jobs that are behind schedule and taking resources from jobs that are ahead of schedule. Emphasis(More)
  • 1