BatchQueue: Fast and memory-thrifty core to core communication

Proceedings - 22nd International Symposium on Computer Architecture and High Performance Computing, SBAC-PAD 2010

Volumn , Issue , 2010, Pages 215-222

  Preud'homme, Thomas ^a   Sopena, Julien ^a   Thomas, Gaël ^a   Folliot, Bertil ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BATCH PROCESSING; COMMUNICATION OVERHEADS; HIGH THROUGHPUT; MULTI-CORE SYSTEMS; OPTIMAL PERFORMANCE; REAL TIME REQUIREMENT; SEQUENTIAL APPLICATIONS;

CACHE MEMORY; COMMUNICATION SYSTEMS; MICROPROCESSOR CHIPS;

COMPUTER ARCHITECTURE;

EID: 78650735454     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SBAC-PAD.2010.34     Document Type: Conference Paper

References (17)

1. U. Drepper. What every programmer should know about memory, 2007.
2. J. Giacomoni, T. Mosely, and M. Vachharajani. Fastforward for efficient pipeline parallelism: A cache-optimized concurrent lock-free queue. In In PPoPP'08: Proceedings of the The 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM Press, 2008.
3. A. Gottlieb, B. Lubachevsky, and L. Rudolph. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Transactions on Programming Languages and Systems (TOPLAS), 5(2):189, 1983.
4. M. Hoffman, O. Shalev, and N. Shavit. The baskets queue. Principles of Distributed Systems, pages 401-414, 2007.
5. E. Ladan-Mozes and N. Shavit. An optimistic approach to lock-free FIFO queues. Proceedings of Distributed Computing, pages 117-131, 2004.
6. L. Lamport. Specifying concurrent program modules. ACM Trans. Program. Lang. Syst., 5(2):190-222, 1983.
7. P. Lee, T. Bu, and G. Chandranmenon. A Lock-Free, Cache-Efficient Multi-Core Synchronization Mechanism for Line-Rate Network Traffic Monitoring. In IPDPS'10: Proceedings of 24th IEEE International Parallel and Distributed Processing Symposium, 2010.
8. J. Mellor-Crummey. Concurrent queues: Practical fetchand- φ algorithms. Technical report, Technical Report 229, Computer Science Department, University of Rochester, 1987.
9. M. Michael and M. Scott. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. Journal of Parallel and Distributed Computing, 51(1):1-26, 1998.
10. M. Moir, D. Nussbaum, O. Shalev, and N. Shavit. Using elimination to implement scalable and lock-free fifo queues. In Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, page 262. ACM, 2005.
11. S. Prakash, Y. Lee, and T. Johnson. Non-blocking algorithms for concurrent data structures. Technical report, University of Florida, 1991.
12. S. Prakash, Y. Lee, and T. Johnson. A nonblocking algorithm for shared queues using compare-and-swap. IEEE Transactions on Computers, pages 548-559, 1994.
13. Single-chip Cloud Computer. http://techresearch.intel.com/articles/Tera- Scale/1826.htm.
14. P. Tsigas and Y. Zhang. A simple, fast and scalable nonblocking concurrent fifo queue for shared memory multiprocessor systems. In Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, page 143. ACM, 2001.
15. J. Valois. Implementing lock-free queues. In In Proceedings of the Seventh International Conference on Parallel and Distributed Computing Systems, Las Vegas, NV, pages 64-69, 1994.
16. C.Wang, H.-s. Kim, Y.Wu, and V. Ying. Compiler-managed software-based redundant multi-threading for transient fault detection. In CGO'07: Proceedings of the International Symposium on Code Generation and Optimization, pages 244-258, Washington, DC, USA, 2007. IEEE Computer Society.
17. Y. Zhang, K. Ootsu, T. Yokota, and T. Baba. Clustered Communication for Efficient Pipelined Multithreading on Commodity MCPs. IAENG International Journal of Computer Science, 36, 2009.