Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
ffnamespace:architecture [2014/08/14 13:31] aldinuc |
ffnamespace:architecture [2014/08/14 15:13] aldinuc [References] |
||
|---|---|---|---|
| Line 53: | Line 53: | ||
| At the core patterns level, patterns to build a graph of ''ff_node''s are defined. Since the graph of ''ff_node''s is a streaming network, any FastFlow graph is built using two streaming patterns (''farm'' and ''pipeline'') and one pattern-modifier (''loopback'', to build cyclic networks). These patterns can be arbitrarily nested to build large and complex graphs. However, not all graphs can be build. This enforce the correctness (by-construction) of all streaming networks that can be generated. In particular, they are deadlock-free and data-race free. | At the core patterns level, patterns to build a graph of ''ff_node''s are defined. Since the graph of ''ff_node''s is a streaming network, any FastFlow graph is built using two streaming patterns (''farm'' and ''pipeline'') and one pattern-modifier (''loopback'', to build cyclic networks). These patterns can be arbitrarily nested to build large and complex graphs. However, not all graphs can be build. This enforce the correctness (by-construction) of all streaming networks that can be generated. In particular, they are deadlock-free and data-race free. | ||
| + | |||
| + | === Nonblocking and Blocking behaviour === | ||
| + | |||
| + | FastFlow run-time is designed to exhibit a nonblocking behaviour (by way of lock-free and wait-free algorithms, at least in the synchronisation critical paths). This design choice mainly targets efficiency for very fine grain parallelism. | ||
| + | |||
| + | === Deadlock avoidance === | ||
| === Accelerator mode === | === Accelerator mode === | ||
| Line 76: | Line 82: | ||
| More details on FastFlow accelerator technology can be found in [ADK11]. | More details on FastFlow accelerator technology can be found in [ADK11]. | ||
| - | === Nonblocking and Blocking behaviour === | ||
| - | |||
| - | === Deadlock avoidance === | ||
| Line 168: | Line 171: | ||
| [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]] | ||
| - | |||
| - | [AMT09] M. Aldinucci, M. Meneghin, and M. Torquati. Efficient Smith-Waterman on multi-core with fastflow. In Proc. of Intl. Euromicro PDP 2010: Parallel Distributed and network-based Processing, Pisa, Italy, Feb. 2010. IEEE. To appear. [[ffnamespace:about|(Paper Draft)]] | ||
| [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
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 3.0 Unported
