4926 search results - page 115 / 986 » Two Graph Algorithms On an Associative Computing Model |
107
click to vote
CCGRID
2010
IEEE
15 years 3 months ago
2010
IEEE
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
124
click to vote
PPAM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
150
Voted
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
139
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
124
Voted
EDCC
2005
Springer
15 years 8 months ago
2005
Springer
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...