Sciweavers

1053 search results - page 117 / 211
» Estimating Execution Time of Distributed Applications
Sort
View
JSSPP
1997
Springer
15 years 7 months ago
An Experimental Evaluation of Processor Pool-Based Scheduling for Shared-Memory NUMA Multiprocessors
In this paper we describe the design, implementation and experimental evaluation of a technique for operating system schedulers called processor pool-based scheduling [51]. Our tec...
Tim Brecht
CASCON
1994
123views Education» more  CASCON 1994»
15 years 4 months ago
Integrating real-time and partial-order information in event-data displays
The events occurring in the execution of a distributed or parallel application are related by a partial, rather than a total, order. We have developed prototype software that coll...
David J. Taylor, Michael H. Coffin
IEEEPACT
2009
IEEE
15 years 25 days ago
Cache Sharing Management for Performance Fairness in Chip Multiprocessors
Resource sharing can cause unfair and unpredictable performance of concurrently executing applications in Chip-Multiprocessors (CMP). The shared last-level cache is one of the mos...
Xing Zhou, Wenguang Chen, Weimin Zheng
DAC
2010
ACM
15 years 7 months ago
Performance yield-driven task allocation and scheduling for MPSoCs under process variation
With the ever-increasing transistor variability in CMOS technology, it is essential to integrate variation-aware performance analysis into the task allocation and scheduling proce...
Lin Huang, Qiang Xu
IPPS
2007
IEEE
15 years 9 months ago
CCA-LISI: On Designing A CCA Parallel Sparse Linear Solver Interface
Sparse linear solvers account for much of the execution time in many high-performance computing (HPC) applications, and not every solver works on all problems. Hence choosing a su...
Fang Liu, Randall Bramley