210 search results - page 7 / 42 » A Scalable Parallel Graph Coloring Algorithm for Distributed... |
IEEEPACT
1998
IEEE
13 years 12 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...
CLUSTER
2011
IEEE
12 years 7 months ago
2011
IEEE
—Much of dense linear algebra has been successfully blocked to concentrate the majority of its time in the Level 3 BLAS, which are not only efficient for serial computation, but...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
ICPP
1999
IEEE
13 years 12 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...
HIPC
2009
Springer
13 years 5 months ago
2009
Springer
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...