Currently, most supercomputers are multicore clusters. This type of architectures is said to be hybrid, because they combine distributed memory with shared memory. Traditional parallel programming paradigms (message passing and shared memory) cannot be naturally adapted to the hardware features offered by these architectures. A parallel paradigm that combines message passing with shared memory is expected to better exploit them. Therefore, in this paper the performance of two parallel programming paradigms (message passing and combination of message passing with shared memory) is analyzed for multicore clusters. The study case used is the construction of phylogenetic trees by means of the Neighbor-Joining method. Finally, conclusions and fu...
This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Compute...
Parallel programming frameworks such as the Message Passing Interface (MPI), Partitioned Global Addr...
Branch&Bound (B&B) is a technique widely used to solve combinatorial optimization problems in physic...
Currently, most supercomputers are multicore clusters. This type of architectures is said to be hybr...
Building phylogenetic trees is one of the significant applications within bioinformatics, mainly due...
Taking into account the increase in use of the multi-core cluster architecture, in this paper we ana...
The mixing of shared memory and message passing programming models within a single application has o...
Hybrid programming, whereby shared-memory and message-passing programming techniques are combined wi...
The hybrid message passing + shared memory programming model combines two parallel programming style...
With the end of Dennard scaling, future high performance computers are expected to consist of distri...
Hybrid programming, whereby shared-memory and mes-sage-passing programming techniques are combined w...
HPC (high perfomance computing) based on clusters of multicores is one of the main research lines in...
We describe a methodology for developing high performance programs running on clusters of SMP no...
Hybrid programming, whereby shared memory and message passing programming techniques are combined wi...
The majority of current HPC applications are composed of complex and irregular data structures that ...
This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Compute...
Parallel programming frameworks such as the Message Passing Interface (MPI), Partitioned Global Addr...
Branch&Bound (B&B) is a technique widely used to solve combinatorial optimization problems in physic...
Currently, most supercomputers are multicore clusters. This type of architectures is said to be hybr...
Building phylogenetic trees is one of the significant applications within bioinformatics, mainly due...
Taking into account the increase in use of the multi-core cluster architecture, in this paper we ana...
The mixing of shared memory and message passing programming models within a single application has o...
Hybrid programming, whereby shared-memory and message-passing programming techniques are combined wi...
The hybrid message passing + shared memory programming model combines two parallel programming style...
With the end of Dennard scaling, future high performance computers are expected to consist of distri...
Hybrid programming, whereby shared-memory and mes-sage-passing programming techniques are combined w...
HPC (high perfomance computing) based on clusters of multicores is one of the main research lines in...
We describe a methodology for developing high performance programs running on clusters of SMP no...
Hybrid programming, whereby shared memory and message passing programming techniques are combined wi...
The majority of current HPC applications are composed of complex and irregular data structures that ...
This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Compute...
Parallel programming frameworks such as the Message Passing Interface (MPI), Partitioned Global Addr...
Branch&Bound (B&B) is a technique widely used to solve combinatorial optimization problems in physic...