Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Benoit Marchand

dblp:12/3324 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Parallel and multicore computing · 68% High-performance computing · 18% Cloud and datacenter computing · 14%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
genomic sequence analysis
0.112011
Highly scalable ab initio genomic motif identification · SC 2011
Bioinformatics and computational biology › sequence analysis
motif discovery
0.112011
Highly scalable ab initio genomic motif identification · SC 2011
Parallel and multicore computing › parallel programming models › hybrid programming models
hybrid MPI/OpenMP
0.112011
Highly scalable ab initio genomic motif identification · SC 2011
Parallel and multicore computing › parallel computing
scalable parallel computing
0.112011
Highly scalable ab initio genomic motif identification · SC 2011
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.112006
Storage solutions II - Accelerating data for compute clusters and grids · SC 2006
High-performance computing
data-intensive computing
0.112006
Storage solutions II - Accelerating data for compute clusters and grids · SC 2006
Parallel and multicore computing
parallel programming models
0.012011
Highly scalable ab initio genomic motif identification · SC 2011
Parallel and multicore computing › parallel computing › parallel communication
data broadcasting
0.012006
Storage solutions II - Accelerating data for compute clusters and grids · SC 2006
High-performance computing
data transfer
0.012006
Storage solutions II - Accelerating data for compute clusters and grids · SC 2006

Methods — techniques the papers use, named apart from their topics

master-slave work assignment · 0.2OpenMP · 0.2MPI · 0.2
YearPublicationVenuePosition
2011 Highly scalable ab initio genomic motif identification
abstract
We present results of scaling an ab initio motif family identification system, Dragon Motif Finder (DMF), to 65,536 processor cores of IBM Blue Gene/P. DMF seeks groups of mutually similar polynucleotide patterns within a set of genomic sequences and builds various motif families from them. Such information is of relevance to many problems in life sciences. Prior attempts to scale such ab initio motif-finding algorithms achieved limited success. We solve the scalability issues using a combination of mixed-mode MPI-OpenMP parallel programming, master-slave work assignment, multi-level workload distribution, multi-level MPI collectives, and serial optimizations. While the scalability of our algorithm was excellent (94% parallel efficiency on 65,536 cores relative to 256 cores on a modest-size problem), the final speedup with respect to the original serial code exceeded 250,000 when serial optimizations are included. This enabled us to carry out many large-scale ab initio motif-finding simulations in a few hours while the original serial code would have needed decades of execution time.
Benoit Marchand, Vladimir B. Bajic, Dinesh K. Kaushik
SC1
2006 Storage solutions II - Accelerating data for compute clusters and grids
abstract
Effective scaling and maximal throughput for clusters is an ongoing issue for computational workloads. We will discuss an approach to workload distribution which is data-centric, rather than process-centric. Data is moved to nodes ahead of computation. The workload management is handled as usual, except that the presence of data at nodes is used to trigger process scheduling. We will discuss how to create workflows which are data-activated and how an asynchronous pipeline can be established, allowing file serving latency to be hidden.In addition our RepliCator solution provides broadcasting to all nodes in a cluster simultaneously, substantially reducing data transfer times. This can be highly effective for throughput problems. We will present benchmark results obtained on clusters with several hundred cpus. Speedups in overall processing of factors of 2.5 to 4.5 have been observed using the combination of data-activated processing and data broadcasting provided by RepliCator data transfer management software.
Benoit Marchand
SC1