1536 search results - page 218 / 308 » DPS - Dynamic Parallel Schedules |
142
click to vote
PVM
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors ...
107
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
125
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
140
click to vote
ICDCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Database queries, in particular, event-driven continuous queries, are useful for many pervasive computing applications, such as video surveillance. In order to enable these applic...
127
click to vote
JSSPP
2005
Springer
15 years 9 months ago
2005
Springer
User estimates of job runtimes have emerged as an important component of the workload on parallel machines, and can have a significant impact on how a scheduler treats different ...