skip to main content
Idioma:

Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures

Sanjuan-Estrada, J. F. ; Casado, L. G. ; García, I.

Journal of supercomputing, 2011-12, Vol.58 (3), p.376-384 [Periódico revisado por pares]

Boston: Springer US

Texto completo disponível

Citações Citado por
  • Título:
    Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures
  • Autor: Sanjuan-Estrada, J. F. ; Casado, L. G. ; García, I.
  • Assuntos: Applied sciences ; Compilers ; Computer Science ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Interpreters ; Language processing and microprogramming ; Processor Architectures ; Programming Languages ; Software
  • É parte de: Journal of supercomputing, 2011-12, Vol.58 (3), p.376-384
  • Descrição: This work studies how to adapt the number of threads of a parallel Interval Branch and Bound algorithm to the available computational resources based on its current performance. Basically, a thread can create a new thread that will process part of the ancestor workload. In this way, load balancing is inherent to the creation of threads. The applications in which we are interested use branch-and-bound algorithms which are highly irregular and therefore difficult to predict. The proposed methods can be used for more predictable algorithms as well. This research complements and does not substitute other devices that improve the exploitation of the system, such as dynamic scheduling policies or work-stealing. Several approaches are presented. They differ in the metrics used and in the need or not having to modify the Operating System (O.S.). The scenario for this research is just one multithreaded application running in a multicore architecture. Experimental results show that the appropriate number of running threads can be determined at run-time, avoiding having to statically establish the number of threads of an application. Thread creation decisions have to be made frequently to obtain better results, but are time-consuming. One of the presented models uses the existence of an idle processor to carry out these decisions, obtaining the desired results.
  • Editor: Boston: Springer US
  • Idioma: Inglês
Links
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.