Sciweavers

660 search results - page 124 / 132
» Parallel Computer Workload Modeling with Markov Chains
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Considerations for Sizing Buffers in Optical Packet Switched Networks
— Optical packet switches of the foreseeable future are expected to have severely limited buffering capability, since storage of optical signals remains a difficult and expensiv...
Arun Vishwanath, Vijay Sivaraman, George N. Rouska...
IEEEPACT
2003
IEEE
14 years 29 days ago
Constraint Graph Analysis of Multithreaded Programs
This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions fo...
Harold W. Cain, Mikko H. Lipasti, Ravi Nair
JSSPP
2004
Springer
14 years 1 months ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan
ICS
2004
Tsinghua U.
14 years 1 months ago
Cluster prefetch: tolerating on-chip wire delays in clustered microarchitectures
The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute...
Rajeev Balasubramonian
FOCS
2004
IEEE
13 years 11 months ago
Shuffling by Semi-Random Transpositions
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Elchanan Mossel, Yuval Peres, Alistair Sinclair