• No results found

Cover Page The handle

N/A
N/A
Protected

Academic year: 2021

Share "Cover Page The handle"

Copied!
4
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Cover Page

The handle http://hdl.handle.net/1887/18620 holds various files of this Leiden University dissertation.

Author: Tran, Minh Ngoc

Title: Workload modeling and performance evaluation in parallel systems

Issue Date: 2012-03-22

(2)

Acknowledgements

I have experienced four years in Leiden, as a PhD student, with lots of memories, where I received many kind helps from colleagues, friends, and my family members.

Therefore, I would like to thank them since I probably could not have nished my research well without their helps.

I am grateful to Thieu, Mattias, Kristian, Gerard, Walter, Vian, Saskia, for their kind supports on commenting my thesis, interesting discussion and social life.

I would like to thank my Vietnamese friends, who gave me unforgettable parties that made my life in the Netherlands more exciting and relaxing.

I express my special thanks to my parents and my younger sister. I always feel comfortable and motivated every time I see their dear face. Last but not least, my most special thanks are dedicated to Thuy, my darling wife, for sharing my diculties and giving me an invaluable present: Gia Khuong, our lovely son.

(3)

126 Acknowledgements

(4)

Curriculum Vitae

Tran Ngoc Minh was born on December 15, 1982, in Dong Nai, Vietnam. He received the BEng degree in computer engineering in 2005 from Ho Chi Minh University of Technology (HCMUT), Vietnam. Since 2005 he was recruited as a young lecturer at HCMUT. At the same time, he pursued and obtained the MSc degree in com- puter science in 2007, also from HCMUT. In the summer of 2007, he was oered a DAAD scholarship for short-term research at the Interdisciplinary Center for Scien- tic Computing, University of Heidelberg, Germany. Since April 2008, he joined the Leiden Institute of Advance Computer Science at Leiden University, the Netherlands, where he pursued and obtained a PhD degree in computer science on March 2012.

His research interests are in the areas of resource management and scheduling, par- ticularly in performance analysis, modeling and evaluation of large-scale parallel and distributed systems.

Referenties

GERELATEERDE DOCUMENTEN

Both of these things can be seen in the graph in figure 50, which shows that the two signal tests actually is not performing that badly but has a lot of loss where it has

In 2008 he obtained his Bachelor of Informatics at Leiden University of Applied Sciences, after which he obtained his master Computer Science in 2012 at Leiden University

candidate at the Leiden Institute of Advanced Computer Science (LIACS), Leiden University, the Netherlands.. He worked within the Software Engineering Group under the supervision

Note that for every internal → vertex in P, we will have as many incoming arcs as outgoing arcs, next to possibly a number of nondirected edges... 5 Find a minimal spanning tree

For each of the following mathematical statements, (1) translate the statement into common English and (2) tell whether it is true or

Internal consultations with the departments is not always easy, but a good relationship develops with the National Institute for Drinking Water Supply, the Zuid-Holland Provincial

in [NPRS04] that in the n ≥ 2t + 1 setting a gen- eral communication overhead lower bound holds for perfectly secure message transmission protocols of n−2t n , regardless on the

Let K be an algebraic number field and S a set of places on K of finite cardinality s, containing all infinite places.. Our method of proof is not a refinement