Member of the Scalable Systems and Software Research Group at Lehigh University
Advised by Professor Roberto Palmieri
Research Interests
Concurrent data structures and algorithms
Multi-threaded and parallel programming
Algorithm design
NUMA aware designs
Publications
Olivia Grimes, Matthew Rodriguez, Ahmed Hassan, Michael Spear, Roberto Palmieri. Brief Announcement: QPID: A Scalable, Strict Concurrent Priority Queue. 38th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, July 6-10, 2026, London, England.
Olivia Grimes, Panagiota Fatourou, Ahmed Hassan, Roberto Palmieri. PIPQ: A Strict Insert-Optimized Concurrent Priority Queue. 39th International Symposium on Distributed Computing, DISC, October 27-31, 2025, Berlin, Germany.
Olivia Grimes, Jacob Nelson-Slivon, Ahmed Hassan, Roberto Palmieri. Opportunities and Limitations of Hardware Timestamps in Concurrent Data Structures. 37th IEEE International Parallel & Distributed Processing Symposium, IPDPS, May 15-19, 2023, St. Petersburg, Florida USA.
Current Work
Relaxed Priority Queue
Extending PIPQ (see citation in "Publications") by implementing a relaxed version which is meant to be NUMA-aware, and maintain a tighter bound than recent state-of-the-art relaxed priority queue designs, while maintaining performance in common application benchmarks.
SkipHash Priority QueueÂ
Developing a priority queue composed of two internal data structures, namely a skip list and a hash table, to target common patterns exhibited by graph applications, such as SSSP, PPSP, and BFS, in which the range of priorities inserted to the priority queue is small.