Dr Vincent Gramoli

PhD in Computer Science at INRIA and Université de Rennes 1, France
Lecturer

J12 - The School of Information Technologies
The University of Sydney

Telephone +61 2 9036 9270
Fax +61 2 9351 3838

Website School of Information Technologies

Personal page

Biographical details

Vincent Gramoli leads the Network major of the Master in IT at the University of Sydney and is affiliated with NICTA. Prior to this, he was affiliated with INRIA in France, with University of Connecticut and Cornell University in the US, and with University of Neuchâtel and EPFL in Switzerland.

Vincent's research into distributed computing spans different areas ranging from shared-memory to message-passing environments. His current interests lie in leveraging concurrency of chip multiprocessors at a small scale and tolerating dynamism of distributed systems at a larger scale.

Teaching and supervision

COMP2121 - Principles of Distributed Systems and Networks

COMP5416 - Advanced Network Technologies

Selected publications

Download citations: PDF RTF Endnote

Edited Books

  • Gramoli, V., Guerraoui, R. (2013). Networked Systems. Springer Lecture Notes in Computer Science.

Book Chapters

  • Gramoli, V., Guerraoui, R. (2013). Lecture Notes in Computer Science: Preface. (pp. VI-VI).

Journals

  • Gramoli, V., Guerraoui, R. (2014). Democratizing Transactional Programming. Communications of the ACM, 57(1), 86-93. [More Information]
  • Gramoli, V., Guerraoui, R. (2014). Reusable Concurrent Data Types. Lecture Notes in Computer Science (LNCS), 8586, 182-206. [More Information]
  • Crain, T., Gramoli, V., Raynal, M. (2013). A contention-friendly binary search tree. Lecture Notes in Computer Science (LNCS), 8097, 229-240. [More Information]
  • Gramoli, V., Milani, A. (2012). WTTM 2012, The Fourth Workshop on the Theory of Transactional Memory. ACM SIGACT News, 43(4), 116-122. [More Information]

Conferences

  • Gramoli, V., Santosa, A. (2014). Why inheritance anomaly is not worth solving. 9th ICOOOLPS (Implementation, Compilation, Optimization of OO Languages, Programs and Systems) workshop, 2014. ACM Digital Library. [More Information]
  • Gramoli, V., Guerraoui, R., Letia, M. (2013). Composing Relaxed Transactions. 27th IEEE International Parallel & Distributed Processing Symposium, Piscataway, New Jersey: (IEEE) Institute of Electrical and Electronics Engineers. [More Information]
  • Crain, T., Gramoli, V., Raynal, M. (2013). No Hot Spot Non-blocking Skip List. 2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops, Piscataway, United States: IEEE Xplore. [More Information]
  • Crain, T., Gramoli, V., Raynal, M. (2012). A Speculation-Friendly Binary Search Tree. 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming, New York: Association for Computing Machinery (ACM).
  • Gramoli, V., Kuznetsov, P., Ravi, S. (2012). Brief Announcement - From Sequential to Concurrent: Correctness and Relative Efficiency. 2012 ACM Symposium on Principles of Distributed Computing, PODC12, New York: Association for Computing Machinery (ACM). [More Information]
  • Crain, T., Gramoli, V., Raynal, M. (2012). Brief Announcement: A Contention-Friendly, Non-blocking Skip List. 26th International Symposium on Distributed Computing (DISC) 2012, Heidelberg: Springer.
  • Gramoli, V., Guerraoui, R., Trigonakis, V. (2012). TM2C: a Software Transactional Memory for Many-Cores. 7th European Conference on Computer Systems (EuroSys12), 2012, New York: Association for Computing Machinery (ACM).

2014

  • Gramoli, V., Guerraoui, R. (2014). Democratizing Transactional Programming. Communications of the ACM, 57(1), 86-93. [More Information]
  • Gramoli, V., Guerraoui, R. (2014). Reusable Concurrent Data Types. Lecture Notes in Computer Science (LNCS), 8586, 182-206. [More Information]
  • Gramoli, V., Santosa, A. (2014). Why inheritance anomaly is not worth solving. 9th ICOOOLPS (Implementation, Compilation, Optimization of OO Languages, Programs and Systems) workshop, 2014. ACM Digital Library. [More Information]

2013

  • Crain, T., Gramoli, V., Raynal, M. (2013). A contention-friendly binary search tree. Lecture Notes in Computer Science (LNCS), 8097, 229-240. [More Information]
  • Gramoli, V., Guerraoui, R., Letia, M. (2013). Composing Relaxed Transactions. 27th IEEE International Parallel & Distributed Processing Symposium, Piscataway, New Jersey: (IEEE) Institute of Electrical and Electronics Engineers. [More Information]
  • Gramoli, V., Guerraoui, R. (2013). Lecture Notes in Computer Science: Preface. (pp. VI-VI).
  • Gramoli, V., Guerraoui, R. (2013). Networked Systems. Springer Lecture Notes in Computer Science.
  • Crain, T., Gramoli, V., Raynal, M. (2013). No Hot Spot Non-blocking Skip List. 2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops, Piscataway, United States: IEEE Xplore. [More Information]

2012

  • Crain, T., Gramoli, V., Raynal, M. (2012). A Speculation-Friendly Binary Search Tree. 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming, New York: Association for Computing Machinery (ACM).
  • Gramoli, V., Kuznetsov, P., Ravi, S. (2012). Brief Announcement - From Sequential to Concurrent: Correctness and Relative Efficiency. 2012 ACM Symposium on Principles of Distributed Computing, PODC12, New York: Association for Computing Machinery (ACM). [More Information]
  • Crain, T., Gramoli, V., Raynal, M. (2012). Brief Announcement: A Contention-Friendly, Non-blocking Skip List. 26th International Symposium on Distributed Computing (DISC) 2012, Heidelberg: Springer.
  • Gramoli, V., Guerraoui, R., Trigonakis, V. (2012). TM2C: a Software Transactional Memory for Many-Cores. 7th European Conference on Computer Systems (EuroSys12), 2012, New York: Association for Computing Machinery (ACM).
  • Gramoli, V., Milani, A. (2012). WTTM 2012, The Fourth Workshop on the Theory of Transactional Memory. ACM SIGACT News, 43(4), 116-122. [More Information]

For support on your academic profile contact .