Alexander Ditter

Friedrich-Alexander-Universität Erlangen-Nürnberg

Papers

1

Total Citations

4

H-Index

1

About

Alexander Ditter is a researcher in concurrent data structures and real-time systems, with a focus on designing thread-safe, wait-free algorithms for multi-core processors. His most cited work, "A wait-free queue for multiple enqueuers and multiple dequeuers using local preferences and pragmatic extensions" (2009), addresses a critical challenge in parallel computing: enabling efficient, lock-free queue operations without blocking, even under high contention. By introducing local preferences and pragmatic extensions, Ditter’s queue design ensures progress for all threads, making it particularly valuable for real-time applications like robotic controls, where predictability and performance are paramount. This contribution has garnered 4 citations, reflecting its niche but significant impact on the field of concurrent programming. Ditter’s work bridges the gap between theoretical wait-free guarantees and practical implementation, offering a robust solution for multi-core environments. His research underscores the importance of data structure design in modern computing, especially as parallelization becomes essential in time-sensitive systems. For students and researchers exploring concurrency, Ditter’s queue provides a compelling example of how algorithmic innovation can meet real-world constraints.

Research Focus

Key Achievements

1
H-Index
1
Papers
4
Total Citations
4
Avg Citations/Paper
🏆 Most Cited Paper
A wait-free queue for multiple enqueuers and multiple dequeuers using local preferences and pragmatic extensions
4 citations · 2009
📈 Most Prolific Year: 2009 (1 Papers)
🤝 Key Collaborators: 2
🏛 Institutions: Friedrich-Alexander-Universität Erlangen-Nürnberg

Top Papers

  1. 1

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago