66 search results - page 2 / 14 » Lifting sequential graph algorithms for distributed-memory p... |
IEEEPACT
1998
IEEE
13 years 9 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
ICPP
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
EUROPAR
2001
Springer
13 years 10 months ago
2001
Springer
Discovery of sequential patterns is becoming increasingly useful and essential in many scienti c and commercial domains. Enormous sizes of available datasets and possibly large nu...
PVG
2003
IEEE
13 years 10 months ago
2003
IEEE
While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpos...
GECCO
2009
Springer
13 years 3 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...