-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
814 lines (813 loc) · 53.4 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
<!DOCTYPE html>
<html>
<head>
<link href="https://fonts.googleapis.com/css?family=Quicksand:300,400,600&display=swap" rel="stylesheet">
<link href="index.css" rel="stylesheet">
<title>Ludovic Capelli</title>
</head>
<body>
<header>
<section id="categories">
<div id="aboutButton" class="category fakeButton" onclick="location.href='#';">
<p>About</p>
</div><!--
--><div id="degreesButton" class="category fakeButton" onclick="location.href='#degrees'">
<p>Degrees</p>
</div><!--
--><div id="awardsButton" class="category fakeButton" onclick="location.href='#awards'">
<p>Awards</p>
</div><!--
--><div id="publicationsButton" class="category fakeButton" onclick="location.href='#publications'">
<p>Publications</p>
</div><!--
--><div id="experienceButton" class="category fakeButton" onclick="location.href='#experience'">
<p>Experience</p>
</div><!--
--><div id="teachingButton" class="category fakeButton" onclick="location.href='#teaching'">
<p>Teaching</p>
</div><!--
--><div id="volunteeringButton" class="category fakeButton" onclick="location.href='#volunteering'">
<p>Volunteering</p>
</div>
</section>
</header>
<section id="mainSection">
<div id="about">
<div id="photo">
<img src="/images/me2.jpg" alt="Photo of Ludovic Capelli">
<img src="/images/me.jpg" alt="Photo of Ludovic Capelli">
</div>
<h1>Ludovic Capelli</h1>
<div id="contactLogos">
<a class="contactLogo" href="https://github.com/capellil" title="Link to the GitHub profile"><img src="/images/github.svg"></a>
<a class="contactLogo" href="https://www.linkedin.com/in/capellil/" title="Link to the LinkedIn profile"><img src="/images/linkedin.svg"></a>
<a class="contactLogo" href="https://orcid.org/0000-0002-6578-2459" title="Link to the ORCID profile"><img src="/images/orcid.svg"></a>
<a class="contactLogo" href="https://scholar.google.com/citations?user=m7Z9NjAAAAAJ&hl=en" title="Link to the Google scholar profile"><img src="/images/googlescholar.svg"></a>
<a class="contactLogo" href="https://www.researchgate.net/scientific-contributions/2145590862_Ludovic_A_R_Capelli" title="Link to the ResearchGate profile"><img src="/images/researchgate.svg"></a>
</div>
<p>Training and Education Manager at <a href="https://pawsey.org.au" alt="Link to the Pawsey website.">Pawsey</a>, <a href="https://www.csiro.au/en/" alt="Link to the CSIRO's website.">CSIRO</a>, United Kingdom.</p>
<a id="emailAddressLink" href="mailto:[email protected]">[email protected]</a>
<p id="inANutshell">In a nutshell: passionate about high-performance computing, and equally passionate about teaching it.</p>
</div>
<section id="degrees">
<h1 style="background-color: rgb(28, 154, 251);">Degrees</h1>
<div>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/degree.svg">
<p class="date">Jan 2025<br/>↑<br/>Oct 2023</p>
</div>
<div class="description">
<h1>Postgraduate Certificate in Academic practice</h1>
<p><strong>From</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Comment</strong>: focusses on the development of high quality teaching, also accredited by the Higher Education Academy, where "holders of the Certificate are therefore automatically eligible to become Fellows of the Academy" (<a href="https://www.ed.ac.uk/institute-academic-development/learning-teaching/cpd/postgraduate-certificate/accreditation" alt="Link to the postgraduate certificate in academic practice accreditation page.">source</a>).</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/degree.svg">
<p class="date">Oct 2022<br/>↑<br/>Apr 2018</p>
</div>
<div class="description">
<h1>Doctor of Philosophy in Pervasive Parallelism</h1>
<p><strong>From</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Comment</strong>: second phase of the Centre for Doctoral Training in Pervasive Parallelism. My research focuses on the optimisation of the vertex-centric programming model for graph processing.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/degree.svg">
<p class="date">Aug 2017<br/>↑<br/>Sep 2016</p>
</div>
<div class="description">
<h1>Master of Science by Research in Pervasive Parallelism</h1>
<p><strong>From</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Comment</strong>: first phase of the Centre for Doctoral Training in Pervasive Parallelism.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/degree.svg">
<p class="date">Aug 2016<br/>↑<br/>Sep 2015</p>
</div>
<div class="description">
<h1>Master of Science in High Performance Computing with Data Science</h1>
<p><strong>From</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Comment</strong>: awarded first class. Obtained with distinction; awarded by The University of Edinburgh when a student maintains first class grades in every semester indepentently.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/degree.svg">
<p class="date">Aug 2015<br/>↑<br/>Sep 2013</p>
</div>
<div class="description">
<h1>Bachelor of Science with Honours in Computing Science</h1>
<p><strong>From</strong>: Edinburgh Napier University in Edinburgh, United Kingdom.</p>
<p><strong>Comment</strong>: awarded first class. Ranked #1 overall, #1 or #2 in all individual modules and in the top 10 out of 155 for the group module.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/degree.svg">
<p class="date">Aug 2014<br/>↑<br/>Sep 2013</p>
</div>
<div class="description">
<h1>French DUETI in Computing Science</h1>
<p><strong>From</strong>: Grenoble Alpes University in Grenoble, France.</p>
<p><strong>Comment</strong>: awarded first class. This year-long university degree runs while enrolled in a programme of study abroad.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/degree.svg">
<p class="date">Aug 2013<br/>↑<br/>Sep 2012</p>
</div>
<div class="description">
<h1>French DUT in Computing Science</h1>
<p><strong>From</strong>: Grenoble Alpes University in Grenoble, France.</p>
<p><strong>Comment</strong>: awarded first class. Ranked #1. This 2-year university degree is equivalent to a Higher National Diploma in the United Kingdom or an Associate's Degree in the United States of America for instance. It was achieved in a unusual format called "special year" where the 2-year degree is actually achieved in a single year. This harder version is available only to students already holding a 2-year degree.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/degree.svg">
<p class="date">Aug 2012<br/>↑<br/>Sep 2010</p>
</div>
<div class="description">
<h1>French BTS in Accounting and Organisations Management</h1>
<p><strong>From</strong>: Edouard Herriot Secondary School in Voiron, France.</p>
<p><strong>Comment</strong>: awarded first class. This 2-year degree is equivalent to a Higher National Diploma in the United Kingdom or an Associate's Degree in the United States of America for instance.</p>
</div>
</article>
</div>
</section>
<section id="awards">
<h1 style="background-color: rgb(247, 185, 43);">Awards</h1>
<div>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/award.svg">
<p class="date">Apr 2021</p>
</div>
<div class="description">
<h1>Huawei UK R&D Fellowship</h1>
<p><strong>From</strong>: Huawei.</p>
<p><strong>What</strong>: "The Huawei Fellowship Programme supports the development of talented Ph.D. students to solve the most challenging problems in their disciplines and make innovative breakthroughs in computing technologies." <em>(Source: Huawei flyer)</em></p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/award.svg">
<p class="date">Jul 2018</p>
</div>
<div class="description">
<h1>HPC Programming Challenge Winner (MPI and CPU categories)</h1>
<p><strong>From</strong>: the International HPC Summer School.</p>
<p><strong>What</strong>: award given to the author of the fastest MPI-code and fastest CPU-code in the HPC programming challenge; a week-long competition where contestants are provided with a source code to optimise.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/award.svg">
<p class="date">Sep 2017</p>
</div>
<div class="description">
<h1>Selected to Attend the Heidelberg Laureate Forum</h1>
<p><strong>From</strong>: the Heidelberg Laureate Forum Foundation.</p>
<p><strong>What</strong>: the HLF is a week-long program in Germany where 100 young researchers in computing science selected world-wide meet numerous holders of Abel Prize, ACM A.M. Turing Award, ACM Prize, Fields Medal and Nevanlinna Prize.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/award.svg">
<p class="date">Oct 2016</p>
</div>
<div class="description">
<h1>Engineering and Physical Sciences Research Council Scholarship</h1>
<p><strong>From</strong>: the Engineering and Physical Sciences Research Council of the United Kingdom.</p>
<p><strong>What</strong>: a scholarship awarded solely on academic merit which waives the tuition fees, provides a stipend and a travel budget during the 4-year Centre for Doctoral Training in Pervasive Parallelism program.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/award.svg">
<p class="date">Oct 2015</p>
</div>
<div class="description">
<h1>Hackathon winner</h1>
<p><strong>From</strong>: MakeItSocial & SkyScanner.</p>
<p><strong>What</strong>: member of the team who won the hackathon organised by MakeItSocial & SkyScanner, by developing an application to facilitate bill sharing within flatmates.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/award.svg">
<p class="date">Sep 2015</p>
</div>
<div class="description">
<h1>Highly Skilled Workforce Scholarship</h1>
<p><strong>From</strong>: The University of Edinburgh.</p>
<p><strong>What</strong>: a scholarship awarded solely on academic merit which waives the tuition fees of the Master of Science in High Performance Computing with Data Science.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/award.svg">
<p class="date">Jul 2015</p>
</div>
<div class="description">
<h1>University Class Medal Winner</h1>
<p><strong>From</strong>: Edinburgh Napier University.</p>
<p><strong>What</strong>: a medal awarded for ranking #1 in a program of study.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/award.svg">
<p class="date">Jun 2015</p>
</div>
<div class="description">
<h1>METERology Prize</h1>
<p><strong>From</strong>: METERology.</p>
<p><strong>What</strong>: prize awarded for innovation in green ICT and overall performance in the Bachelor of Science with Honours in Computing Science.</p>
</div>
</article>
</div>
</section>
<section id="publications">
<h1 style="background-color: rgb(251, 51, 44);">Publications</h1>
<div>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/book.svg">
<p class="date">Jul 2022</p>
</div>
<div class="description">
<h1>NVRAM as an Enabler to New Horizons in Graph Processing</h1>
<p><strong>Published in</strong>: Spring Nature Computer Science</p>
<p><strong>Authors</strong>: <a href="https://scholar.google.com/citations?user=m7Z9NjAAAAAJ&hl=en" title="Link to Google Scholar profile of Ludovic Capelli">Ludovic A. R. Capelli</a>, <a href="https://www.epcc.ed.ac.uk/about/staff/dr-nick-brown" title="Link to EPCC profile of Dr Nick Brown">Nick Brown</a>, <a href="https://www.epcc.ed.ac.uk/about/staff/dr-mark-bull" title="Link to EPCC profile of Dr Mark Brown">Jonathan M. Bull</a></p>
<p><strong>Abstract</strong>: From the world wide web, to genomics, to traffic analysis, graphs are central to many scientific, engineering, and societal endeavours. Therefore an important question is what hardware technologies are most appropriate to invest in and use for processing graphs, whose sizes now frequently reach terabytes. Non-Volatile Random Access Memory (NVRAM) technology is an interesting candidate enabling organisations to extend the memory in their systems typically by an order of magnitude compared to Dynamic Read Access Memory (DRAM) alone. From a software perspective, it permits to store a much larger dataset within a single memory space and avoid the significant communication cost incurred when going off node. However, to obtain optimal performance one must consider carefully how best to integrate this technology with their code to cope with NVRAM esoteric properties such as asymmetric read/write performance or explicit coding for deeper memory hierarchies for instance.
In this paper, we investigate the use of NVRAM in the context of shared memory graph processing via vertex-centric. We find that NVRAM enables the processing of exceptionally large graphs on a single node with good performance, price and power consumption. We also explore the techniques required to most appropriately exploit NVRAM for graph processing and, for the first time, demonstrate the ability to process a graph of 750 billion edges whilst staying within the memory of a single node. Whilst the vertex-centric graph processing methodology is our main focus, not least due to its popularity since introduced by Google over a decade ago, the lessons learnt in this paper apply more widely to graph processing in general.</p>
<p><strong>Digital Object Identifier (DOI)</strong>: <a href="https://doi.org/10.1007/s42979-022-01317-4">10.1007/s42979-022-01317-4</a></p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/book.svg">
<p class="date">Nov 2019</p>
</div>
<div class="description">
<h1>iPregel: Strategies to Deal with an Extreme Form of Irregularity</h1>
<p><strong>Published in</strong>: workshop on Irregular Applications: Architectures and Algorithms hosted at the International Conference for High Performance Computing, Networking, Storage and Analysis.</p>
<p><strong>Authors</strong>: <a href="https://scholar.google.com/citations?user=m7Z9NjAAAAAJ&hl=en" title="Link to Google Scholar profile of Ludovic Capelli">Ludovic A. R. Capelli</a>, <a href="https://www.epcc.ed.ac.uk/about/staff/dr-nick-brown" title="Link to EPCC profile of Dr Nick Brown">Nick Brown</a>, <a href="https://www.epcc.ed.ac.uk/about/staff/dr-mark-bull" title="Link to EPCC profile of Dr Mark Brown">Jonathan M. Bull</a></p>
<p><strong>Abstract</strong>: Vertex-centric programming attracts significant attention in the world of graph processing thanks to its simple interface and the inherent parallelism for the underlying framework to leverage. However, vertex-centric programs represent an extreme form of irregularity; a workload that may greatly vary across supersteps, fine-grain synchronisations and memory accesses unpredictable both in terms of quantity and location.<br/>
In this paper, we explore optimisations to address these challenges: a hybrid combiner, vertex structure externalisation, an edge-centric shift in the workload representation and dynamic load-balancing. The optimisations were integrated into the iPregel vertex-centric framework and evaluated across three benchmarks commonly used in vertex-centric, each run on four publicly available graphs comprising up to a billion edges.<br/>
The result of this work is a set of techniques which we believe not only provides a significant improvement in vertex-centric performance, but are also applicable more generally to irregular applications.</p>
<p><strong>Digital Object Identifier (DOI)</strong>: <a href="https://doi.org/10.1109/IA349570.2019.00013">10.1109/IA349570.2019.00013</a></p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/book.svg">
<p class="date">Aug 2019</p>
</div>
<div class="description">
<h1>iPregel: Vertex-Centric Programmability vs Memory Efficiency and Performance, Why Choose?</h1>
<p><strong>Published in</strong>: Journal of Parallel Computing</p>
<p><strong>Authors</strong>: <a href="https://scholar.google.com/citations?user=m7Z9NjAAAAAJ&hl=en" title="Link to Google Scholar profile of Ludovic Capelli">Ludovic A. R. Capelli</a>, <a href="https://scholar.google.com/citations?user=MvGKdLoAAAAJ&hl=en" title="Link to Google Scholar profile of Zhenjiang Hu">Zhenjiang Hu</a>, <a href="https://scholar.google.com/citations?user=WUcMUEcAAAAJ&hl=en" title="Link to Google Scholar profile of Timothy Zakian">Timothy A. K. Zakian</a>, <a href="https://www.epcc.ed.ac.uk/about/staff/dr-nick-brown" title="Link to EPCC profile of Dr Nick Brown">Nick Brown</a>, <a href="https://www.epcc.ed.ac.uk/about/staff/dr-mark-bull" title="Link to EPCC profile of Dr Mark Brown">Jonathan M. Bull</a></p>
<p><strong>Abstract</strong>: The vertex-centric programming model, designed to improve the programmability in graph processing application writing, has attracted great attention over the years. Multiple shared memory frameworks that have implemented the vertex-centric interface all expose a common tradeoff: programmability against memory efficiency and performance.<br/>
Our approach consists in preserving vertex-centric programmability, while implementing optimisations missing from FemtoGraph, developing new ones and designing these so they are transparent to a user's application code, hence not impacting programmability. We therefore implemented our own shared memory vertex-centric framework iPregel, relying on in-memory storage and synchronous execution. In this paper, we evaluate it against FemtoGraph, whose characteristics are identical, but also an asynchronous counterpart GraphChi and the vertex-subset-centric framework Ligra. Our experiments include three of the most popular vertex-centric benchmark applications over 4 real-world publicly accessible graphs, which cover all orders of magnitude between a million to a billion edges. We then measure the execution time and the peak memory usage. Finally, we evaluate the programmability of each framework by comparing it against the original Pregel, Google's closed-source implementation that started the whole area of vertex-centric programming.<br/>
Experiments demonstrate that iPregel, like FemtoGraph, does not sacrifice vertex-centric programmability for additional performance and memory efficiency optimisations, which contrasts with GraphChi and Ligra. Sacrificing vertex-centric programmability allowed the latter to benefit from substantial performance and memory efficiency gains. However, experiments demonstrate that iPregel is up to 2300 times faster than FemtoGraph, as well as generating a memory footprint up to 100 times smaller. These results greatly change the situation; Ligra and GraphChi are up to 17,000 and 700 times faster than FemtoGraph but, when comparing against iPregel, this maximum speed-up drops to 10. Furthermore, on PageRank, it is iPregel that proves to be the fastest overall. When it comes to memory efficiency, the same observation applies; Ligra and GraphChi are 100 and 50 times lighter than FemtoGraph, but iPregel nullifies these benefits: it provides the same memory efficiency as Ligra and even proves to be 3 to 6 times lighter than GraphChi on average. In other words, iPregel demonstrates that preserving vertex-centric programmability is not incompatible with a competitive performance and memory efficiency.</p>
<p><strong>Digital Object Identifier (DOI)</strong>: <a href="https://doi.org/10.1016/j.parco.2019.04.005">10.1016/j.parco.2019.04.005</a></p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/book.svg">
<p class="date">May 2019</p>
</div>
<div class="description">
<h1>Incrementalization of Vertex-Centric Programs.</h1>
<p><strong>Published in</strong>: IEEE International Parallel and Distributed Processing Symposium</p>
<p><strong>Authors</strong>: <a href="https://scholar.google.com/citations?user=WUcMUEcAAAAJ&hl=en" title="Link to Google Scholar profile of Timothy Zakian">Timothy A. K. Zakian</a>, <a href="https://scholar.google.com/citations?user=m7Z9NjAAAAAJ&hl=en" title="Link to Google Scholar profile of Ludovic Capelli">Ludovic A. R. Capelli</a>, <a href="https://scholar.google.com/citations?user=MvGKdLoAAAAJ&hl=en" title="Link to Google Scholar profile of Zhenjiang Hu">Zhenjiang Hu</a></p>
<p><strong>Abstract</strong>: As the graphs in our world become ever larger, the need for programmable, easy to use, and highly scalable graph processing has become ever greater. One such popular graph processing model, the vertex-centric computational model, does precisely this by distributing computations across the vertices of the graph being computed over. Due to this distribution of the program to the vertices of the graph, the programmer "thinks like a vertex" when writing their graph computation, with limited to no sense of shared memory and where almost all communication between each on-vertex computation must be sent over the network. Because of this inherent communication overhead in the computational model, reducing the number of messages sent while performing a given computation is a central aspect of any efforts to optimize vertex-centric programs. While previous work has focused on reducing communication overhead by directly changing communication patterns by altering the way the graph is partitioned and distributed, or by altering the graph topology itself. In this paper we present a different optimization strategy based on a family of complementary compile-time program transformations in order to minimize communication overhead by changing both the messaging and computational structures of programs. Particularly, we present and formalize a method by which a compiler can automatically incrementalize a vertex-centric program through a series of compile-time program transformations by modifying the on-vertex computation and messaging between vertices so that messages between vertices represent patches to be applied to the other vertex's local state. We empirically evaluate these transformations on a set of common vertex-centric algorithms and graphs and achieve an average reduction of 2.7X in total computational time, and 2.9X in the number of messages sent across all programs in the benchmark suite. Furthermore, since these are compile-time program transformations alone, other prior optimization strategies for vertex-centric programs can work with the resulting vertex-centric program just as they would a non-incrementalized program.</p>
<p><strong>Digital Object Identifier (DOI)</strong>: <a href="10.1109/IPDPS.2019.00109" title="DOI of the publication entitled "Incrementalization of Vertex-Centric Programs".">10.1109/IPDPS.2019.00109</a></p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/book.svg">
<p class="date">Aug 2018</p>
</div>
<div class="description">
<h1>iPregel: A Combiner-Based In-Memory Shared Memory Vertex-Centric Framework.</h1>
<p><strong>Published in</strong>: workshop on Parallel Programming Models and Systems Software for High-End Computing hosted at the International Conference on Parallel Processing</p>
<p><strong>Authors</strong>: <a href="https://scholar.google.com/citations?user=m7Z9NjAAAAAJ&hl=en" title="Link to Google Scholar profile of Ludovic Capelli">Ludovic A. R. Capelli</a>, <a href="https://scholar.google.com/citations?user=MvGKdLoAAAAJ&hl=en" title="Link to Google Scholar profile of Zhenjiang Hu">Zhenjiang Hu</a>, <a href="https://scholar.google.com/citations?user=WUcMUEcAAAAJ&hl=en" title="Link to Google Scholar profile of Timothy Zakian">Timothy A. K. Zakian</a></p>
<p><strong>Abstract</strong>: The expressiveness of the vertex-centric programming model introduced by Pregel attracted great attention. Over the years, numerous frameworks emerged, abiding by the same programming model, while relying on widely different architectural designs. The vast majority of existing vertex-centric frameworks exploits distributed memory parallelism or out-of-core computations. To our knowledge, only one vertex-centric framework is designed upon in-memory storage and shared memory parallelism. Unfortunately, while built on a faster architecture than that of other vertex-centric frameworks, it did not prove to significantly outperform other existing solutions.<br/>
In this paper we present iPregel: another in-memory shared memory vertex-centric framework. The optimisations developed and presented in this paper particularly target three hotspots of vertex-centric calculations: selecting active vertices, routing messages to their recipient and updating recipients inbox. We compare iPregel against the state-of-the-art in-memory distributed memory framework Pregel+ on three of the most common vertex-centric applications: PageRank, Hashmin and the Single-Source Shortest Path. Experiments demonstrate that the single-node framework iPregel is faster than its distributed memory counterpart until at least 11 nodes are used. Further experiments show that iPregel completes a PageRank application with an order of magnitude less memory than popular vertex-centric frameworks.</p>
<p><strong>Digital Object Identifier (DOI)</strong>: <a href="https://doi.org/10.1145/3229710.3229719">10.1145/3229710.3229719</a></p>
</div>
</article>
</div>
</section>
<section id="experience">
<h1 style="background-color: rgb(36, 173, 39);">Experience</h1>
<div>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/experience.svg">
<p class="date">Present<br/>↑<br/>Jan 2025</p>
</div>
<div class="description">
<h1>Training and Education Manager</h1>
<p><strong>Where</strong>: Pawsey Supercomputing Centre in Perth, Australia</p>
<p><strong>What</strong>: leading the team dedicated to the upskilling of Pawsey's staff and researchers, as well as supporting efforts towards STEM education and outreach initiatives.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/experience.svg">
<p class="date">Dec 2024<br/>↑<br/>Nov 2022</p>
</div>
<div class="description">
<h1>Teaching Fellow</h1>
<p><strong>Where</strong>: EPCC in Edinburgh, United Kingdom</p>
<p><strong>What</strong>: position focussing exclusively on the teaching components at EPCC. Course organiser of the MSc module "Advanced Message-Passing Programming".</p>
</div>
</article><article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/experience.svg">
<p class="date">Present<br/>↑<br/>Sep 2023</p>
</div>
<div class="description">
<h1>Acaemic Cohort Lead</h1>
<p><strong>Where</strong>: EPCC in Edinburgh, United Kingdom</p>
<p><strong>What</strong>: position focussing on providing students with academic, as part of the new student support model.</p>
</div>
</article><article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/experience.svg">
<p class="date">Nov 2020<br/>↑<br/>May 2020</p>
</div>
<div class="description">
<h1>Computational Fluid Dynamics Engineer</h1>
<p><strong>Where</strong>: Renault Sport Racing in Enstone, United Kingdom</p>
<p><strong>What</strong>: internship consisting in improving the speed and resilience of parallel CFD calculations, developing an understanding of HPC and providing an insight into industry best practice and future HPC technologies.</p>
</div>
</article><article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/experience.svg">
<p class="date">Apr 2018<br/>↑<br/>Oct 2017</p>
</div>
<div class="description">
<h1>Lab Assistant</h1>
<p><strong>Where</strong>: the National Institute of Informatics in Tokyo, Japan</p>
<p><strong>What</strong>: internship focusing on the optimisation of the vertex-centric programming model.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/experience.svg">
<p class="date">Apr 2016<br/>↑<br/>Jan 2016</p>
</div>
<div class="description">
<h1>Lab Associate</h1>
<p><strong>Where</strong>: Disney Research in Edinburgh, United Kingdom</p>
<p><strong>What</strong>: as a member of the Real-Time Digital Acting team; I investigated techniques for real-time 2D facial landmarks tracking.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/experience.svg">
<p class="date">Sep 2014<br/>↑<br/>Jul 2014</p>
</div>
<div class="description">
<h1>Flow Controller</h1>
<p><strong>Where</strong>: Schneider Eletric Energy & Sustainability Services in Moirans, France</p>
<p><strong>What</strong>: focusing on logistics and supply chain to aim for a smooth management of resources.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/experience.svg">
<p class="date">Aug 2013<br/>↑<br/>Jul 2013</p>
</div>
<div class="description">
<h1>Human-Machine Interface Developer</h1>
<p><strong>Where</strong>: Centum Adeneo in Moirans, France</p>
<p><strong>What</strong>: internship first focusing on source code refactoring and makefile generators, then working on the graphical interface of AVAP3000; a device that enables fast data acquisition in aircraft testing, using C++ / Qt programming.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/experience.svg">
<p class="date">Dec 2011<br/><br/>and<br/><br/>May 2011<br/>↑<br/>Jan 2011</p>
</div>
<div class="description">
<h1>Accountant</h1>
<p><strong>Where</strong>: MAATEL in Moirans, France</p>
<p><strong>What</strong>: internship aiming at learning and practicing daily tasks of an accountant; from invoice registration to bank statement analysis.</p>
</div>
</article>
</div>
</section>
<section id="teaching">
<h1 style="background-color: rgb(134, 36, 173);">Teaching</h1>
<div>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/teaching.svg">
<p class="date">Dec 2024<br/>↑<br/>Jan 2023<br/></p>
</div>
<div class="description">
<h1>Advanced Message-Passing Programming</h1>
<p><strong>Where</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Role</strong>: Course organiser.</p>
<p><strong>Level</strong>: Master's degree.</p>
<p><strong>Covers</strong>:</p>
<ul>
<li>Scalability challenges</li>
<li>Leading-edge HPC architectures</li>
<li>MPI Internals</li>
<li>Message-passing optimisations</li>
<li>Parallel performance tools</li>
<li>Performance modelling</li>
<li>Single-sided protocols</li>
<li>Exploiting heterogeneous architectures</li>
<li>Advanced load-balancing techniques</li>
<li>Parallel file systems and parallel IO</li>
<li>Choice of programming model/language</li>
</ul>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/teaching.svg">
<p class="date">Dec 2024<br/>↑<br/>Sep 2024<br/></p>
</div>
<div class="description">
<h1>Programming Languages in High-Performance Computing</h1>
<p><strong>Where</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Role</strong>: Course organiser.</p>
<p><strong>Level</strong>: Master's degree.</p>
<p><strong>Covers</strong>:</p>
<ul>
<li>principles of compiled vs interpreted languages</li>
<li>performance comparison of the two approaches</li>
<li>essentials of the C language</li>
<li>compiler fundamentals</li>
<li>an exposure to compiler optimisations</li>
<li>array processing and use of standard libraries</li>
<li>C++ core principles for HPC (templates, resource management, standard library), and additional features (polymorphic structures and inheritance)</li>
<li>overview of other languages such as Fortran, Java and Rust</li>
<li>threading approaches</li>
</ul>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/teaching.svg">
<p class="date">May 2020<br/>↑<br/>Jan 2020<br/><br/>and<br/><br/>May 2019<br/>↑<br/>Jan 2019<br/><br/>and<br/><br/>May 2017<br/>↑<br/>Jan 2017</p>
</div>
<div class="description">
<h1>Advanced Parallel Programming</h1>
<p><strong>Where</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Role</strong>: Teaching assistant.</p>
<p><strong>Level</strong>: Master's degree.</p>
<p><strong>Covers</strong>:</p>
<ul>
<li>Scalability challenges</li>
<li>Leading-edge HPC architectures</li>
<li>MPI Internals</li>
<li>Message-passing optimisations</li>
<li>Parallel performance tools</li>
<li>Performance modelling</li>
<li>Single-sided protocols</li>
<li>Exploiting heterogeneous architectures</li>
<li>Advanced load-balancing techniques</li>
<li>Parallel file systems and parallel IO</li>
<li>Verification and fault tolerance</li>
<li>Choice of programming model/language</li>
</ul>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/teaching.svg">
<p class="date">Dec 2019<br/>↑<br/>Sep 2019<br/><br/>and<br/><br/>Dec 2018<br/>↑<br/>Sep 2018<br/><br/>and<br/><br/>Dec 2016<br/>↑<br/>Sep 2016</p>
</div>
<div class="description">
<h1>Message Passing Programming</h1>
<p><strong>Where</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Role</strong>: Teaching assistant.</p>
<p><strong>Level</strong>: Master's degree.</p>
<p><strong>Covers</strong>:</p>
<ul>
<li>The message-passing model</li>
<li>Message-passing parallelisation of a regular domain code</li>
<li>MPI terminology</li>
<li>The anatomy of send and receive (synchronous and asynchronous)</li>
<li>Point-to-point message-passing example (pi)</li>
<li>Bandwidth and latency via pingpong (synchronous and asynchronous)</li>
<li>Non-blocking operations</li>
<li>Collectives</li>
<li>Communicator management: topologies and partitioning</li>
<li>Derived datatypes (focusing mainly on array subsections)</li>
<li>Practicalities / Hints and Tips</li>
<li>MPI implementations</li>
</ul>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/teaching.svg">
<p class="date">Dec 2018<br/>↑<br/>Sep 2018<br/><br/>and<br/><br/>Dec 2016<br/>↑<br/>Sep 2016</p>
</div>
<div class="description">
<h1>High Performance Computing Architectures</h1>
<p><strong>Where</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Role</strong>: Teaching assistant.</p>
<p><strong>Level</strong>: Master's degree.</p>
<p><strong>Covers</strong>:</p>
<ul>
<li>Basic components of HPC systems: processors, memory, interconnect, storage.</li>
<li>Classification of architectures: SIMD/MIMD, shared vs distributed memory, clusters</li>
<li>System software: OSs, processes, threads, scheduling, batch systems.</li>
<li>Brief history of HPC systems, including Moore's Law.</li>
<li>CPU design: functional units, instructions sets, pipelining, branch prediction, ILP (superscalar, VLIW, SIMD instructions), multithreading.</li>
<li>Caches: operation and design features</li>
<li>Memory: operation and design features, including cache coherency and consistency</li>
<li>Multicore CPUs, including cache and memory hierarchy</li>
<li>GPGPUs: operation and design features</li>
<li>Interconnects: operation and design features</li>
<li>Current HPC architectures</li>
</ul>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/teaching.svg">
<p class="date">May 2017<br/>↑<br/>Jan 2017</p>
</div>
<div class="description">
<h1>High Performance Computing Ecosystems</h1>
<p><strong>Where</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Role</strong>: Teaching assistant.</p>
<p><strong>Level</strong>: Master's degree.</p>
<p><strong>Covers</strong>:</p>
<ol>
<li>EPCC Core Lectures, covering the following topics:</li>
<ul>
<li>Distributed computing</li>
<li>Cloud computing</li>
<li>Trends and demographics in HPC</li>
<li>HPC vendors</li>
<li>HPC users and their requirements</li>
<li>HPC system procurement</li>
<li>HPC in Europe</li>
<li>Exascale computing</li>
</ul>
<li>Guest Lectures from HPC vendors, researchers, and users</li>
<li>Practicals on:</li>
<ul>
<li>Cloud computing</li>
<li>HPC system procurement</li>
</ul>
</ol>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/teaching.svg">
<p class="date">Dec 2022<br/>↑<br/>Sep 2022<br/><br/>and<br/><br/>Dec 2019<br/>↑<br/>Sep 2019<br/><br/>and<br/><br/>Dec 2018<br/>↑<br/>Sep 2018<br/><br/>and<br/><br/>Dec 2016<br/>↑<br/>Sep 2016</p>
</div>
<div class="description">
<h1>Threaded Programming</h1>
<p><strong>Where</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Role</strong>: Teaching assistant.</p>
<p><strong>Level</strong>: Master's degree.</p>
<p><strong>Covers</strong>:</p>
<ul>
<li>Basic concepts of shared memory: threads, tasks, shared/private data, synchronisation.</li>
<li>Concepts of OpenMP: parallel regions, shared/private variables, parallel loops, reductions</li>
<li>OpenMP parallel regions and associated clauses</li>
<li>OpenMP worksharing directives, scheduling of parallel loops</li>
<li>OpenMP synchronisation: barriers, critical sections, atomics, locks.</li>
<li>OpenMP tasks</li>
<li>Additional features of OpenMP: nesting, orphaning, threadprivate globals, OpenMP 4.0 features</li>
<li>OpenmP implementations</li>
<li>Basic concepts of Posix threads, Boost/C++0x threads, Intel TBB, Java threads</li>
<li>Comparison of APIs</li>
</ul>
<p>Lectures will be followed by tutored practical sessions illustrating the key concepts. Students will have the choice of using either C or Fortran in the practical programming sessions on OpenMP.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/teaching.svg">
<p class="date">May 2020<br/>↑<br/>Jan 2020<br/><br/>and<br/><br/>May 2019<br/>↑<br/>Jan 2019<br/><br/>and<br/><br/>May 2017<br/>↑<br/>Jan 2017</p>
</div>
<div class="description">
<h1>Parallel Design Patterns</h1>
<p><strong>Where</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Role</strong>: Teaching assistant.</p>
<p><strong>Level</strong>: Master's degree.</p>
<p><strong>Covers</strong>:</p>
<ul>
<li>Task Parallelism</li>
<li>Recursive Splitting</li>
<li>Geometric Decomposition</li>
<li>Pipeline</li>
<li>Discrete Event</li>
<li>Actors</li>
<li>Master / Worker</li>
<li>Loop Parallelism</li>
<li>Fork / Join</li>
<li>Shared Data and Queues</li>
<li>Active Messaging</li>
</ul>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/teaching.svg">
<p class="date">Dec 2018<br/>↑<br/>Sep 2018<br/><br/>and<br/><br/>Dec 2016<br/>↑<br/>Sep 2016</p>
</div>
<div class="description">
<h1>Fundamentals of Data Management</h1>
<p><strong>Where</strong>: The University of Edinburgh in Edinburgh, United Kingdom.</p>
<p><strong>Role</strong>: Teaching assistant.</p>
<p><strong>Level</strong>: Master's degree.</p>
<p><strong>Covers</strong>:</p>
<ul>
<li>Why managing research data better matters, and why it's hard</li>
<li>Data management planning: a required part of twenty first century research</li>
<li>Data formats: structuring data and keeping them useful</li>
<li>Metadata: describing data and keeping them useful</li>
<li>Publication and citation of research data</li>
<li>Persistence, preservation and provenance of research data</li>
<li>Licensing, copyright and access rights: some things researchers need to know</li>
</ul>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/teaching.svg">
<p class="date">May 2015<br/>↑<br/>Jan 2015</p>
</div>
<div class="description">
<h1>Advanced Database Systems</h1>
<p><strong>Where</strong>: Edinburgh Napier University in Edinburgh, United Kingdom.</p>
<p><strong>Role</strong>: Demonstrator.</p>
<p><strong>Level</strong>: Bachelor's degree.</p>
<p><strong>Covers</strong>:</p>
<ul>
<li>Object-Relational Databases - data modelling techniques, querying, database implementation: practical utilisation of an advanced database management system to implement a non-relational data model.</li>
<li>Data Warehouses - Why are data warehouses needed? Difference between data warehouses and traditional databases, data modelling techniques, implementation issues</li>
<li>Big Data Analytics - What is big data? Differences between big data and other databases, an introduction to big data analytics.</li>
<li>Emerging database techniques.</li>
</ul>
</div>
</article>
</div>
</section>
<section id="volunteering">
<h1 style="background-color: rgb(247, 97, 43);">Volunteering</h1>
<div>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/volunteering.svg">
<p class="date">Present<br/>↑<br/>Oct 2023</p>
</div>
<div class="description">
<h1>Member of the International Society for the Scholarship of Teaching and Learning</h1>
<p><strong>Where</strong>: the International Society for the Scholarship of Teaching and Learning (ISSOTL).</p>
<p><strong>What</strong>: the ISSOTL "serves faculty members, staff, and students who care about teaching and learning as serious intellectual work. Through building intellectual and collaborative infrastructure, the Society supports the associational life that fosters scholarly work about teaching and learning." (<a href="https://issotl.com/about-issotl/" alt="Link to the ISSOTL about page.">Source</a>)</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/volunteering.svg">
<p class="date">Present<br/>↑<br/>Mar 2023</p>
</div>
<div class="description">
<h1>Member of the OpenMP language committee</h1>
<p><strong>Where</strong>: the OpenMP language committee</p>
<p><strong>What</strong>: the OpenMP language committee is in charge of the standardisation of "directive-based multi-language high-level parallelism". (<a href="https://www.openmp.org/about/about-us/" alt="Link to the OpenMP about page.">Source</a>)</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/volunteering.svg">
<p class="date">Present<br/>↑<br/>Feb 2023</p>
</div>
<div class="description">
<h1>Member of the MPI Forum.</h1>
<p><strong>Where</strong>: the MPI Forum</p>
<p><strong>What</strong>: the MPI Forum is in charge of the standardisation of the Message-Passing Interface (MPI).</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/volunteering.svg">
<p class="date">May 2023</p>
</div>
<div class="description">
<h1>Manager of the EPCC booth at ISC</h1>
<p><strong>Where</strong>: the International Supercomputing Conference (ISC) in Hamburg, Germany.</p>
<p><strong>What</strong>: the booth manager is in charge of handling the logistics, coordination and construction/dismantle of equipments, including the cluster used for the competition, to the ISC conference. In the case of EPCC, this implies ensuring the shipment of HPC equipments worth over £400,000.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/volunteering.svg">
<p class="date">Jul 2023<br/>↑<br/>Jul 2019</p>
</div>
<div class="description">
<h1>Organiser of the HPC Programming Challenge</h1>
<p><strong>Where</strong>: the International High-Performance Computing Summer School.</p>
<p><strong>What</strong>: The IHPCSS programming challenge is a 5-day programming competition where students practice the technologies they learn during the summer school. The objective is to optimise the source code provided as much as they can, using shared-memory parallelism, distributed-memory parallelism, GPU offloading, or any combination of the three.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/volunteering.svg">
<p class="date">Sep 2019<br/>↑<br/>Jun 2017</p>
</div>
<div class="description">
<h1>STEM Ambassador</h1>
<p><strong>Where</strong>: the Science, Technology, Engineering and Mathematics learning network, in Edinburgh, United Kingdom.</p>
<p><strong>What</strong>: "Stem Ambassadors are volunteers for a wide range of science, technology, engineering and mathematics (STEM) related jobs and disciplines across the United Kingdom. They offer their time and enthusiasm to help bring STEM subjects to life and demonstrate their value in life and careers. STEM Ambassadors are an important and exciting free-of-charge resource for teachers and others engaging with young people in and outside the classroom."<br/>
(Source: STEM website <a href="www.stem.org.uk" title="Link to the STEM website">www.stem.org.uk</a>)</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/volunteering.svg">
<p class="date">Jun 2017<br/><br/>and<br/><br/>Jun 2016</p>
</div>
<div class="description">
<h1>Volunteering Student</h1>
<p><strong>Where</strong>: the International SuperComputing conference in Frankfurt, Germany.</p>
<p><strong>What</strong>: participating in the student volunteer programme to help run the ISC conference; the international event for High Performance Computing, Networking and Storage.<br/>
Student volunteer assisted in:
<ul>
<li>ISCNet</li>
<li>Acquisition of Participant Data</li>
<li>Set up of Exhibition, Registration, Poster Sessions, Signane and Standing Banners.</li>
<li>Dismantling Process</li>
<li>Exhibitor Services</li>
<li>Registration and Check in Process</li>
<li>Assistance of Session, Speakers and Catering.</p></li>
</ul>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/volunteering.svg">
<p class="date">May 2015<br/>↑<br/>Sep 2014</p>
</div>
<div class="description">
<h1>Programme Representative</h1>
<p><strong>Where</strong>: Edinburgh Napier University in Edinburgh, United Kingdom.</p>
<p><strong>What</strong>: program representatives act as an interface between students and staff to facilitate communications and interactions. Sometimes, this results in being at the heart of a conflict, nonetheless, the bottom line is we are all on the same boat doing our best to make the most of our BSc experience.<br/>
Attending "Student & Staff" committees, forums and events is the primary role of a program representative; doing our best to improve the student experience at univerisity.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/volunteering.svg">
<p class="date">May 2015<br/>↑<br/>Sep 2014</p>
</div>
<div class="description">
<h1>Student Mentor</h1>
<p><strong>Where</strong>: Edinburgh Napier University in Edinburgh, United Kingdom.</p>
<p><strong>What</strong>: being a mentor translates to being the one who informs the mentoree about services they can access, how to best prepare to upcoming exams, projects and so on. However, knowing how to listen is the cornerstone to the one willing to become a good mentor. Furthermore, a mentor must be aware of what they cannot / should not handle, and know to whom signpost the student mentored.</p>
</div>
</article>
<article>
<div class="timeEntry">
<img class="logo" height=30 width=30 src="/images/volunteering.svg">
<p class="date">Jun 2012<br/>↑<br/>Sep 2011</p>
</div>
<div class="description">
<h1>Treasurer of the "Association of Senior Technicians in Accounting"</h1>
<p><strong>Where</strong>: Edouard Herriot Secondary School in Voiron, France.</p>
<p><strong>What</strong>: the Association of Senior Technicians in Accounting is internal to the Edouard Herriot Secondary School; it handles the budget allocated to the BTS in Accounting and Organisations Management to fund trips to museums or theaters for instance. Being a member of this association implies serious responsabilities since the money managed is as real as it gets. In addition to being a real study case to the student, this position requires dedication, hardwork and honesty. With weekly appointements with the bank and overall supervision from teachers, such an association demands an efficient management as well as an exemplary behaviour from its team members.</p>
</div>
</article>
</div>
</section>
</section>
<footer>
<p>Icons from <a href="https://uxwing.com/">www.uxwing.com</a> and made by <a href="https://www.flaticon.com/<?=_('authors/')?>freepik" title="Freepik">Freepik</a> from <a href="https://www.flaticon.com/" title="Flaticon">www.flaticon.com</a>.</p>
<p id='copyright'>©<p>
<script type="text/javascript">
const CurrentYear = new Date().getFullYear();
const CopyrightStatement = document.getElementById('copyright');
CopyrightStatement.innerText += " 2019-" + CurrentYear + " Ludovic Capelli";
</script>
</footer>
</body>
</html>