Parallel solution of the subset-sum problem: An empirical study

Concurrency and Computation: Practice and Experience

Volumn 24, Issue 18, 2012, Pages 2241-2254

  Bokhari, Saniyah S ^a  

^a The Ohio State University   (United States)

Author keywords

Cray XMT; dynamic programming; IBM x3755; multicore; multithreading; NVIDIA FX 5800; OMP; Opteron; parallel algorithms; parallel computing; shared memory; subset sum problem

Indexed keywords

COMPUTER GRAPHICS; COMPUTER GRAPHICS EQUIPMENT; DYNAMIC PROGRAMMING; GRAPHICS PROCESSING UNIT; MULTICORE PROGRAMMING; MULTITASKING; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; PROGRAM PROCESSORS; SET THEORY;

CRAY XMT; IBM X3755; MULTI CORE; MULTI-THREADING; NVIDIA FX 5800; OPTERON; SHARED MEMORY; SUBSET SUM PROBLEMS;

MEMORY ARCHITECTURE;

EID: 84868583937     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.2800     Document Type: Article

References (16)

1. Alverson G, Alverson R, Callahan D, Koblenz B, Porterfield A, Smith B,. Exploiting heterogeneous parallelism on a multithreaded multiprocessor. In Proc. Int. Conf. Supercomputing, 1992; 188-187.
2. Alverson R, Callahan D, Cummings D, Koblenz B, Porterfield A, Smith B,. The Tera computer system. Proc. Int. Conf. Supercomputing, 1990; 1-6.
3. Snavely A, Carter L, Boisseau J, Majumdar A, Gatlin KS, Mitchell N, Feo J, Koblenz B,. Multi-processor performance on the Tera MTA. In Proceedings of the 1998 ACM/IEEE conference on Supercomputing, 1998; 1-8.
4. Bokhari S, Saltz J,. Exploring the performance of massively multithreaded architectures. Concurrency and Computation: Practice and Experience 2010; 22 (5): 588-616.
5. Che S, Boyer M, Meng J, Tarjan D, Sheaffer JW, Skadron K,. A performance study of general-purpose applications on graphics processors using CUDA. Journal of Parallel and Distributed Computing 2008; 68 (10): 1370-1380.
6. Nickolls J, Buck I, Garland M, Skadron K,. Scalable parallel programming with CUDA. Queue 2008; 6: 40-53.
7. NVIDIA. CUDA C Best Practices Guide 3.2, 2010.http://developer.download. nvidia.com/compute/cuda/3-2/toolkit/docs/CUDA-C-Best-Practices-Guide.pdf.
8. NVIDIA. NVIDIA CUDA Programming Guide 3.0, 2010. http://developer. download.nvidia.com/compute/cuda/3-0/toolkit/docs/NVIDIA-CUDA-ProgrammingGuide. pdf.
9. Garey MR, Johnson DS,. Computers and Intractability. W. H. Freeman: New York, 1979.
10. Horowitz E, Sahni S,. Computing partitions with applications to the knapsack problem. Journal of the ACM 1974; 21 (2): 277-292.
11. Karp RM,. Reducibility among combinatorial problems. In Complexity of Computer Computations, Miller RE, Thatcher JW, (eds). Plenum Press: New York, 1972: 85-103.
12. Grama A, Karypis G, Kumar V, Gupta A,. Introduction to Parallel Computing (2nd Edition), 2nd Edition. Addison Wesley: Reading, 2003.
13. Sanches C, Soma N, Yanasse H,. An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem. European Journal of Operational Research 2007; 176 (2): 870-879.
14. Sanches C, Soma N, Yanasse H,. Parallel time and space upper-bounds for the subset-sum problem. Theoretical Computer Science 2008; 407 (1-3): 342-348.
15. Chedid FB,. An optimal parallelization of the two-list algorithm of cost o(2n/2). Parallel Computing 2008; 34 (1): 63-65.
16. Acosta A, Corujo R, Blanco V, Almeida F,. Dynamic load balancing on heterogeneous multicore/multigpu systems. In High Performance Computing and Simulation (HPCS), 2010 International Conference on, 2010; 467-476.