373 search results - page 28 / 75 » Local Scheduling for Volunteer Computing |
ICPP
1998
IEEE
14 years 5 days ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
HPCA
2012
IEEE
12 years 3 months ago
2012
IEEE
Modern memory systems rely on spatial locality to provide high bandwidth while minimizing memory device power and cost. The trend of increasing the number of cores that share memo...
IEEEPACT
1999
IEEE
14 years 6 days ago
1999
IEEE
An asynchronous superscalar architecture is presented based on a novel architectural feature called instruction compounding. This enables efficient dynamic scheduling and forwardi...
ICPP
1999
IEEE
14 years 6 days ago
1999
IEEE
Most of today's multiprocessors have a DistributedShared Memory (DSM) organization, which enables scalability while retaining the convenience of the shared-memory programming...
PADL
2010
Springer
13 years 10 months ago
2010
Springer
Newer Prolog implementations commonly offer support for multi-threading, and have also begun to offer support for tabling. However, most implementations do not yet integrate tablin...