75 search results - page 7 / 15 » Declarative scheduling in highly scalable systems |
168
click to vote
IWOMP
2009
Springer
16 years 11 days ago
2009
Springer
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...
191
click to vote
PDP
2010
IEEE
15 years 10 months ago
2010
IEEE
Scheduling large amounts of tasks in distributed computing platforms composed of millions of nodes is a challenging goal, even more in a fully decentralized way and with low overhe...
148
click to vote
ANCS
2007
ACM
15 years 9 months ago
2007
ACM
Modern high performance routers rely on sophisticated interconnection networks to meet ever increasing demands on capacity. Previous studies have used a combination of analysis an...
186
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
138
click to vote
IPPS
2007
IEEE
16 years 4 days ago
2007
IEEE
This paper investigates the utilization of the master-slave (MS) paradigm as an alternative to domain decomposition (DD) methods for parallelizing lattice gauge theory (LGT) model...