Sciweavers

967 search results - page 70 / 194
» Multi-users scheduling in parallel systems
Sort
View
IWOMP
2009
Springer
14 years 2 months ago
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Stephen Olivier, Jan Prins
IPPS
2007
IEEE
14 years 2 months ago
Capacity Sharing and Stealing in Dynamic Server-based Real-Time Systems
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making a...
Luís Nogueira, Luís Miguel Pinho
SPAA
2010
ACM
14 years 19 days ago
Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications
Load balancing is an important consideration when running data-parallel programs. While traditional techniques trade off the cost of load imbalance with the overhead of mitigating...
Youngjoon Jo, Milind Kulkarni
ICFP
2008
ACM
14 years 7 months ago
Space profiling for parallel functional programs
This paper presents a semantic space profiler for parallel functional programs. Building on previous work in sequential profiling, our tools help programmers to relate runtime res...
Daniel Spoonhower, Guy E. Blelloch, Robert Harper,...
JSSPP
2004
Springer
14 years 1 months ago
Scheduling on the Top 50 Machines
The well-known TOP500 list ranks the 500 most powerful high-performance computers. However, the list lacks details about the job management and scheduling on these machines. As thi...
Carsten Ernemann, Martin Krogmann, Joachim Lepping...