531 search results - page 34 / 107 » Configurational Workload Characterization |
PE
2010
Springer
13 years 6 months ago
2010
Springer
We propose a trace fitting algorithm for Markovian Arrival Processes (MAPs) that can capture statistics of any order of interarrival times between measured events. By studying re...
MOBISYS
2003
ACM
14 years 7 months ago
2003
ACM
Wireless local-area networks are becoming increasingly popular. They are commonplace on university campuses and inside corporations, and they have started to appear in public area...
JSSPP
2004
Springer
14 years 1 months ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
INFOCOM
2002
IEEE
14 years 17 days ago
2002
IEEE
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
The scheduler is a key component in determining the overall performance of a parallel computer, and as we show here, the schedulers in wide use today exhibit large unexplained gap...