484 search results - page 1 / 97 » To Parallelize or Not to Parallelize, Speed Up Issue |
CORR
2011
Springer
12 years 12 months ago
2011
Springer
PODC
1996
ACM
13 years 9 months ago
1996
ACM
EUROPAR
2006
Springer
13 years 8 months ago
2006
Springer
PARA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
INFOCOM
1999
IEEE
13 years 9 months ago
1999
IEEE
Mirror sites enable client requests to be serviced by any of a number of servers, reducing load at individual servers and dispersing network load. Typically, a client requests serv...