Arunmoezhi Ramachandran

Orcid: 0000-0001-7532-8383

According to our database1, Arunmoezhi Ramachandran authored at least 7 papers between 2013 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
FEAST: A Lightweight Lock-free Concurrent Binary Search Tree.
ACM Trans. Parallel Comput., 2020

2019
Improving efficacy of concurrent internal binary search trees using local recovery.
Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

2017
BenchFoundry: A Benchmarking Framework for Cloud Storage Services.
Proceedings of the Service-Oriented Computing - 15th International Conference, 2017

2016
Improving efficacy of internal binary search trees using local recovery.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

2015
CASTLE: fast concurrent internal binary search tree using edge-based locking.
Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

A Fast Lock-Free Internal Binary Search Tree.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

2013
Performance Evaluation of NAS Parallel Benchmarks on Intel Xeon Phi.
Proceedings of the 42nd International Conference on Parallel Processing, 2013


  Loading...