Mathieu Jan

Dr. Mathieu Jan


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
1 July 2008 in Future Generation Computer Systems
Verified
Journal Article
Closed access
AIAlexandru Iosup
Alexandru Iosup
HLHui Li
Hui Li
MJMathieu Jan
Mathieu Jan
SAShanny Anoep
Shanny Anoep
CDCatalin Dumitrescu
Catalin Dumitrescu
DEDick H.J. Epema
Dick H.J. Epema

1 September 2007
Verified
Conference Paper
Closed access
AIAlexandru Iosup
Alexandru Iosup
MJMathieu Jan
Mathieu Jan
OSOzan Sonmez
Ozan Sonmez
DEDick H.J. Epema
Dick H.J. Epema
Currently deployed grids gather together thousands of computational and storage resources for the benefit of a large community of scientists. However, the large scale, the wide geographical spread, and at times the decision of the rightful resource owners to commit the capacity elsewhere, raises serious resource availability issues. Little is known about the characteristics of the grid resource availability, and of the impact of resource unavailability on the performance of grids. In this work, we make first steps in addressing this twofold lack of information. First, we analyze a long-term availability trace and assess the resource availability characteristics of Grid'5000, an experimental grid environment of over 2,500 processors. The average utilization for the studied trace is increased by almost 5%, when availability is considered. Based on the results of the analysis, we further propose a model for grid resource availability. Our analysis and modeling results show that grid computational resources become unavailable at a high rate, negatively affecting the ability of grids to execute long jobs. Second, through trace-based simulation, we show evidence that resource availability can have a severe impact on the performance of the grid systems. The results of this step show evidence that the performance of a grid system can rise when availability is taken into consideration, and that human administration of availability change information results in 10-15 times more job failures than for an automated monitoring solution, even for a lowly utilized system.

1 January 2005
Verified
Conference Paper
Closed access
GAG. Antoniu
G. Antoniu
PHP. Hatcher
P. Hatcher
MJMathieu Jan
Mathieu Jan
DND.A. Noblet
D.A. Noblet
The arrival of the P2P model has opened many new avenues for research within the field of distributed computing. This is mainly due to important practical features (such as support for volatility, high scalability). Several generic P2P libraries have been proposed for building higher-level services. In order to judge the appropriateness of using a generic P2P library for a given application type, an experimental performance evaluation of the provided functionalities is unavoidable. Very few analyses of this kind have been reported, as most evaluations are limited to complexity analyses and to simulations. Such experimental analyses are important, especially when using P2P software in a grid computing context, where applications may have precise efficiency requirements. In this paper, we focus on JXTA, which provides generic building blocks and protocols intended to serve as a basis for specialized P2P services and applications. We perform a performance evaluation of the three communication layers (endpoint, pipe and socket) over a fast Ethernet local-area network, for recent versions of the J2SE and C bindings of JXTA. We provide a detailed analysis explaining the behavior of these three layers and we give hints showing how to efficiently use them.

1 January 2007
Verified
Book Chapter
Closed access
PDF file
AIAlexandru Iosup
Alexandru Iosup
MJMathieu Jan
Mathieu Jan
OSOzan Sonmez
Ozan Sonmez
DEDick Epema
Dick Epema

10 September 2014 in Real-Time Systems
Verified
Journal Article
Closed access
PDF file
VLVincent Legout
Vincent Legout
MJMathieu Jan
Mathieu Jan
LPLaurent Pautet
Laurent Pautet

1 June 2015
Verified
Conference Paper
Closed access
LALaure Abdallah
Laure Abdallah
MJMathieu Jan
Mathieu Jan
JEJerome Ermont
Jerome Ermont
CFChristian Fraboul
Christian Fraboul
Many-core architectures are promising hardware to design hard real-time systems as they are based on simpler and thus more predictable processors than multi-core systems. However, the worst-case behavior of the Network-on-Chip (NoC) for both inter-core and core to external memories or peripherals communications must be established. Several NoCs targeting hard real-time systems, made of specific hardware extensions, have been designed. However, none of these extensions are currently available in commercially existing NoC-based many-core architectures, that instead rely on wormhole switching with round-robin arbitration. In this paper, we thus demonstrate three properties of such NoC-based wormhole networks to identify worst-case scenarios and reduce the pessimism when modeling flows in contentions. We then describe and evaluate an algorithm to compute Worst-Case Traversal Time (WCTT) of flows that uses these properties. In particular, our results show that the pessimism can be reduced up to 50% compared to current state-of-the-art real-time packet schedulability analysis.