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.
? Tutorial for this page

Matthieu Morel

dblp:85/4713 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

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

Systems, architecture and hardware · 3Databases, data management, data science and information retrieval · 2

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.

Databases, data mining, and information retrieval
2 papers
Transaction processing and concurrency control · 56% Information retrieval · 44%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
distributed transaction processing
0.312017
Omid, Reloaded: Scalable and Highly-Available Transaction Processing · FAST 2017
Information retrieval › distributed information retrieval
distributed search
0.112012
Reactive index replication for distributed search engines · SIGIR 2012
Distributed systems
fault tolerance
0.112017
Omid, Reloaded: Scalable and Highly-Available Transaction Processing · FAST 2017
Distributed systems › fault tolerance
high availability
0.112017
Omid, Reloaded: Scalable and Highly-Available Transaction Processing · FAST 2017
Information retrieval › indexing › inverted index
posting lists
0.012012
Reactive index replication for distributed search engines · SIGIR 2012
Information retrieval
search engines
0.012012
Reactive index replication for distributed search engines · SIGIR 2012

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

online replication · 0.1document popularity · 0.1
YearPublicationVenuePosition
2017 Omid, Reloaded: Scalable and Highly-Available Transaction Processing
Edward Bortnikov, Eshcar Hillel, Idit Keidar, Ivan Kelly, Matthieu Morel, Sameer Paranjpye, Francisco Perez-Sorrosal, Ohad Shacham
FAST5
2012 Reactive index replication for distributed search engines
abstract
Distributed search engines comprise multiple sites deployed across geographically distant regions, each site being specialized to serve the queries of local users. When a search site cannot accurately compute the results of a query, it must forward the query to other sites. This paper considers the problem of selecting the documents indexed by each site focusing on replication to increase the fraction of queries processed locally. We propose RIP, an algorithm for replicating documents and posting lists that is practical and has two important features. RIP evaluates user interests in an online fashion and uses only local data of a site. Being an online approach simplifies the operational complexity, while locality enables higher performance when processing queries and documents. The decision procedure, on top of being online and local, incorporates document popularity and user queries, which is critical when assuming a replication budget for each site. Having a replication budget reflects the hardware constraints of any given site. We evaluate RIP against the approach of replicating popular documents statically, and show that we achieve significant gains, while having the additional benefit of supporting incremental indexes.
Flavio Paiva Junqueira, Vincent Leroy 0001, Matthieu Morel
SIGIR3
2007 Collective Interfaces for Distributed Components
abstract
We propose to address collective communications in distributed components through collective interfaces. Collective interfaces handle data distribution, parallelism and synchronization, and they expose collective behaviors in the definition of components. We show, as an illustration, that collective interfaces allow the encoding of SPMD programming in a better structured and less error prone way. We verify the scalability and performance of collective interfaces in an experiment on up to 100 machines.
Françoise Baude, Denis Caromel, Ludovic Henrio, Matthieu Morel
CCGRID4
2007 Performance and Scalability of a Component-Based Grid Application
abstract
Component-based development has emerged as an effective approach to building flexible systems, but there is little experience in applying this approach to grid programming. This paper presents our experience with reengineering a high performance numerical solver to become a component-based grid application. The adopted component model is an extension of the generic fractal model that specifically targets grid environments. The paper provides qualitative and quantitative evidence that componentisation has improved the modifiability and reusability of the application while not significantly affecting performance.
Nikos Parlavantzas, Matthieu Morel, Vladimir Getov, Françoise Baude, Denis Caromel
IPDPS2