User Tools

Site Tools


Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
ffnamespace:architecture [2014/09/12 19:04]
aldinuc
ffnamespace:architecture [2014/09/12 19:06] (current)
aldinuc
Line 122: Line 122:
 It is interesting to observe that It is interesting to observe that
  
-  * a collective channel (e.g. SPMC, MPSC) implemented via SPSCs+mediator are sometime faster with respect to CAS-based implementation (this really ​depend ​on the platform, parallelism degree and computation grain). +  * a collective channel (e.g. SPMC, MPSC) implemented via SPSCs+mediator are sometime faster with respect to CAS-based implementation (this really ​depends ​on the platform, parallelism degree and computation grain). 
-  * Mediator thread ​make it possible to easily program scheduling policy for both item distribution and gathering. +  * Mediator thread ​makes it possible to easily program scheduling policy for both item distribution and gathering. 
-  * Nonblocking mediator threads ​couples ​very well with hyper threading technology because they typically execute lot of instructions that never arrives to execute stage in the processor pipeline.+  * Nonblocking mediator threads ​couple ​very well with hyper threading technology because they typically execute lot of instructions that never arrives to execute stage in the processor pipeline.
   * Fastflow relies on  wait-free, non-blocking synchronizations. The approach has pros and cons. The main advantage consists in performance:​ avoiding memory fences dramatically reduces cache coherence overhead. ​   * Fastflow relies on  wait-free, non-blocking synchronizations. The approach has pros and cons. The main advantage consists in performance:​ avoiding memory fences dramatically reduces cache coherence overhead. ​
  
Line 178: Line 178:
 [GMV08] J. Giacomoni, T. Moseley, and M. Vachharajani. Fastforward for efficient pipeline parallelism:​ a cache-optimized concurrent lock-free queue. In Proc. of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming (PPoPP), pages 43-52, New York, NY, USA, 2008. ACM. [GMV08] J. Giacomoni, T. Moseley, and M. Vachharajani. Fastforward for efficient pipeline parallelism:​ a cache-optimized concurrent lock-free queue. In Proc. of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming (PPoPP), pages 43-52, New York, NY, USA, 2008. ACM.
  
-[AB+09] K. Asanovic, R. Bodik, J. Demmel, T. Keaveny, K. Keutzer, J. Kubiatowicz,​ N. Morgan, D. Patterson, K. Sen, J. Wawrzynek, D. Wessel, and K. Yelick. A view of the parallel computing landscape. Commun. ACM 52, 10 (Oct. 2009), 56-67. [[http://​doi.acm.org/​10.1145/​1562764.1562783|DOI]]+[AB+09] K. Asanovic, R. Bodik, J. Demmel, T. Keaveny, K. Keutzer, J. Kubiatowicz,​ N. Morgan, D. Patterson, K. Sen, J. Wawrzynek, D. Wessel, and K. Yelick. A view of the parallel computing landscape. Commun. ACM 52, 10 (Oct. 2009), 56-67. [[http://​doi.acm.org/​10.1145/​1562764.1562783|DOI:​10.1145/​1562764.1562783]]
  
 [ADK11] M. Aldinucci, M. Danelutto, P. Kilpatrick, M. Meneghin, and M. Torquati. Accelerating code on multi- cores with fastflow. In Proc. of 17th Intl. Euro-Par 2011 Parallel Processing, volume 6853 of LNCS, pages 170–181, Bordeaux, France, Aug. 2011. Springer. [ADK11] M. Aldinucci, M. Danelutto, P. Kilpatrick, M. Meneghin, and M. Torquati. Accelerating code on multi- cores with fastflow. In Proc. of 17th Intl. Euro-Par 2011 Parallel Processing, volume 6853 of LNCS, pages 170–181, Bordeaux, France, Aug. 2011. Springer.
  
 [ADK12] M. Aldinucci, M. Danelutto, P. Kilpatrick, M. Meneghin, and M. Torquati. An efficient unbounded lock-free queue for multi-core systems. In Proc. of 18th Intl. Euro-Par 2012 Parallel Processing, volume 7484 of LNCS, pages 662–673, Rhodes Island, Greece, aug 2012. Springer. [ADK12] M. Aldinucci, M. Danelutto, P. Kilpatrick, M. Meneghin, and M. Torquati. An efficient unbounded lock-free queue for multi-core systems. In Proc. of 18th Intl. Euro-Par 2012 Parallel Processing, volume 7484 of LNCS, pages 662–673, Rhodes Island, Greece, aug 2012. Springer.
ffnamespace/architecture.txt · Last modified: 2014/09/12 19:06 by aldinuc