Author:
Vu Trong-Tuan,Derbel Bilel,Melab Nouredine
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46, 720–748 (1999)
2. Boukedjar, A., Lalami, M.E., El-Baz, D.: Parallel branch and bound on a CPU-GPU system. In: 20th International Conference on Parallel, Distributed and Network-Based Processing, pp. 392–398 (2012)
3. Carneiro, T., Muritiba, A.E., Negreiros, M., De Campos, L., Augusto, G.: A new parallel schema for branch-and-bound algorithms using GPGPU. In: 23rd Symposium on Computer Architecture and High Performance Computing, pp. 41–47 (2011)
4. Chakroun, I., Melab, M.: An adaptative multi-GPU based branch-and-bound. a case study: the flow-shop scheduling problem. In: 14th IEEE Interernational Conference on High Performance Computing and Communications (2012)
5. Dijkstra, E.W.: Derivation of a termination detection algorithm for distributed computations. In: Broy, M. (ed.) Control Flow and Data Flow: Concepts of Distributed Programming, pp. 507–512. Springer, Berlin (1987)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献