François Taïani

François Taïani

Auto-generated profile, based on publicly available information

François Taïani

IRIF Univ Rennes Inria CNRS IRISA France

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2008 in ACM Transactions on Computer Systems
Verified
Journal Article
Open access
GCGeoff Coulson
Geoff Coulson
GBGordon Blair
Gordon Blair
Paul GracePaul Grace
Paul Grace
FTFrancois Taiani
Francois Taiani
AJAckbar Joolia
Ackbar Joolia
TSThirunavukkarasu Sivaharan
Thirunavukkarasu Sivaharan
Component-based software structuring principles are now commonplace at the application level; but componentization is far less established when it comes to building low-level systems software. Although there have been pioneering efforts in applying componentization to systems-building, these efforts have tended to target specific application domains (e.g., embedded systems, operating systems, communications systems, programmable networking environments, or middleware platforms). They also tend to be targeted at specific deployment environments (e.g., standard personal computer (PC) environments, network processors, or microcontrollers). The disadvantage of this narrow targeting is that it fails to maximize the genericity and abstraction potential of the component approach. In this article, we argue for the benefits and feasibility of a generic yet tailorable approach to component-based systems-building that offers a uniform programming model that is applicable in a wide range of systems-oriented target domains and deployment environments. The component model, called OpenCom , is supported by a reflective runtime architecture that is itself built from components. After describing OpenCom and evaluating its performance and overhead characteristics, we present and evaluate two case studies of systems we have built using OpenCom technology, thus illustrating its benefits and its general applicability.

1 April 2008
Verified
Conference Paper
Open access
PDF file
Paul GracePaul Grace
Paul Grace
DHDanny Hughes
Danny Hughes
BPBarry Porter
Barry Porter
GBGordon S. Blair
Gordon S. Blair
GCGeoff Coulson
Geoff Coulson
FTFrancois Taiani
Francois Taiani
In order to provide an increasing number of functionalities and benefit from sophisticated and application-tailored services from the network, distributed applications are led to integrate an ever-widening range of networking technologies. As these applications become more complex, this requirement for 'network heterogeneity' is becoming a crucial issue in their development. Although progress has been made in the networking community in addressing such needs through the development of network overlays, we claim in this paper that the middleware community has been slow to integrate these advances into middleware architectures, and, hence, to provide the foundational bedrock for heterogeneous distributed applications. In response, we propose our 'open overlays' framework. This framework, which is part of a wider middleware architecture, accommodates 'overlay plug-ins', allows physical nodes to support multiple overlays, supports the stacking of overlays to create composite protocols, and adopts a declarative approach to configurable deployment and dynamic reconfigurability. The framework has been in development for a number of years and supports an extensive range of overlay plug-ins including popular protocols such as Chord and Pastry. We report on our experiences with the open overlays framework, evaluate it in detail, and illustrate its application in a detailed case study of network heterogeneity.status: publishe

1 September 2021 in Theoretical Computer Science
Verified
Journal Article
Closed access
AAAlex Auvolat
Alex Auvolat
DFDavide Frey
Davide Frey
MRMichel Raynal
Michel Raynal
FTFrançois Taïani
François Taïani

1 May 2016
Verified
Conference Paper
Closed access
ABAntoine Boutet
Antoine Boutet
AKAnne-Marie Kermarrec
Anne-Marie Kermarrec
NMNupur Mittal
Nupur Mittal
FTFrancois Taiani
Francois Taiani
K-Nearest-Neighbor (KNN) graphs have emerged as a fundamental building block of many on-line services providing recommendation, similarity search and classification. Constructing a KNN graph rapidly and accurately is, however, a computationally intensive task. As data volumes keep growing, speed and the ability to scale out are becoming critical factors when deploying a KNN algorithm. In this work, we present KIFF, a generic, fast and scalable KNN graph construction algorithm. KIFF directly exploits the bipartite nature of most datasets to which KNN algorithms are applied. This simple but powerful strategy drastically limits the computational cost required to rapidly converge to an accurate KNN solution, especially for sparse datasets. Our evaluation on a representative range of datasets show that KIFF provides, on average, a speed-up factor of 14 against recent state-of-the art solutions while improving the quality of the KNN approximation by 18%.

25 December 2018 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
HLHicham Lakhlef
Hicham Lakhlef
MRMichel Raynal
Michel Raynal
FTFrancois Taiani
Francois Taiani

11 August 2015 in Journal of Internet Services and Applications
Verified
Journal Article
Open access
PDF file
AKAnne-Marie Kermarrec
Anne-Marie Kermarrec
FTFrançois Taïani
François Taïani
Peer-to-peer (P2P) systems have been widely researched over the past decade, leading to highly scalable implementations for a wide range of distributed services and applications. A P2P system assigns symmetric roles to machines, which can act both as client and server. This alleviates the need for any central component to maintain a global knowledge of the system. Instead, each peer takes individual decisions based on a local knowledge of the rest of the system, providing scalability by design.