Evaluation of Speculation in Out-of-Order Execution of Synchronous Dataflow Networks

Dataflow process networks are a convenient formalism for implementing robust concurrent systems that has been successfully used for hardware and software systems in the past. However, the strictly stream-based execution limits the performance of dataflow process networks and requires to carefully ba...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of parallel programming Vol. 43; no. 1; pp. 86 - 129
Main Authors:	Baudisch, Daniel, Schneider, Klaus
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.02.2015 Springer Nature B.V
Subjects:	Analysis Benchmarks Computer networks Computer programming Computer programs Computer Science Embedded systems Energy consumption Formalism Hardware Microprocessors Networks Parallel processing Processor Architectures Programming languages Software Software Engineering/Programming and Operating Systems Studies Switching theory Synchronous Theory of Computation Dataflow networks Compiling Multithreaded software Speculation Out-of-order
ISSN:	0885-7458, 1573-7640
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Dataflow process networks are a convenient formalism for implementing robust concurrent systems that has been successfully used for hardware and software systems in the past. However, the strictly stream-based execution limits the performance of dataflow process networks and requires to carefully balance the entire execution to avoid backpressure and idle nodes. Inspired by related techniques used in processor architectures, we already introduced in our previous work out-of-order execution of dataflow process networks. In this paper, we extend this improvement with speculation of input values for process nodes and allow otherwise idle processes to start computations with speculated input values. Clearly, outputs based on speculated inputs have to be held back until the speculation can be proved right, and have to be withdrawn in case the speculation was wrong. In contrast to related work, our approach has been implemented purely in software using standard hardware to address a broad field of multicore processors. Moreover, a software implementation allows us to dynamically adapt parameters to the needs of the application. This allows us to enforce a user-defined hit ratio of speculation that might even switch speculation off. After a detailed description of this approach and a discussion of possibilities of its implementation, we show its feasibility using a couple of benchmarks. In these benchmarks, the use of speculation achieved an average speedup of 1.2 compared to the non-speculative out-of-order execution.
AbstractList	Issue Title: Special Issue on Embedded Computer Systems: Architectures, Modeling and Simulation Dataflow process networks are a convenient formalism for implementing robust concurrent systems that has been successfully used for hardware and software systems in the past. However, the strictly stream-based execution limits the performance of dataflow process networks and requires to carefully balance the entire execution to avoid backpressure and idle nodes. Inspired by related techniques used in processor architectures, we already introduced in our previous work out-of-order execution of dataflow process networks. In this paper, we extend this improvement with speculation of input values for process nodes and allow otherwise idle processes to start computations with speculated input values. Clearly, outputs based on speculated inputs have to be held back until the speculation can be proved right, and have to be withdrawn in case the speculation was wrong. In contrast to related work, our approach has been implemented purely in software using standard hardware to address a broad field of multicore processors. Moreover, a software implementation allows us to dynamically adapt parameters to the needs of the application. This allows us to enforce a user-defined hit ratio of speculation that might even switch speculation off. After a detailed description of this approach and a discussion of possibilities of its implementation, we show its feasibility using a couple of benchmarks. In these benchmarks, the use of speculation achieved an average speedup of 1.2 compared to the non-speculative out-of-order execution. Dataflow process networks are a convenient formalism for implementing robust concurrent systems that has been successfully used for hardware and software systems in the past. However, the strictly stream-based execution limits the performance of dataflow process networks and requires to carefully balance the entire execution to avoid backpressure and idle nodes. Inspired by related techniques used in processor architectures, we already introduced in our previous work out-of-order execution of dataflow process networks. In this paper, we extend this improvement with speculation of input values for process nodes and allow otherwise idle processes to start computations with speculated input values. Clearly, outputs based on speculated inputs have to be held back until the speculation can be proved right, and have to be withdrawn in case the speculation was wrong. In contrast to related work, our approach has been implemented purely in software using standard hardware to address a broad field of multicore processors. Moreover, a software implementation allows us to dynamically adapt parameters to the needs of the application. This allows us to enforce a user-defined hit ratio of speculation that might even switch speculation off. After a detailed description of this approach and a discussion of possibilities of its implementation, we show its feasibility using a couple of benchmarks. In these benchmarks, the use of speculation achieved an average speedup of 1.2 compared to the non-speculative out-of-order execution.
Author	Baudisch, Daniel Schneider, Klaus
Author_xml	– sequence: 1 givenname: Daniel surname: Baudisch fullname: Baudisch, Daniel email: baudisch@cs.uni-kl.de organization: Embedded Systems Group, Department of Computer Science, University of Kaiserslautern – sequence: 2 givenname: Klaus surname: Schneider fullname: Schneider, Klaus organization: Embedded Systems Group, Department of Computer Science, University of Kaiserslautern
BookMark	eNp1kE9LAzEQxYNUsFY_gLcFL16imWw2SY9S6x8o9mA9hzRNtHWb1GTX2m9vyoqIIHMYhvd7w-Mdo54P3iJ0BuQSCBFXCYjgHBMoMaFCYHqA-lCJEgvOSA_1iZQVFqySR-g4pRUhZCik7KPZ-EPXrW6WwRfBFU8ba9q6O5e-mLYNDg5P48LGYvyZtR9w581rDD60qbjRjXZ12BaPttmG-JZO0KHTdbKn33uAnm_Hs9E9nkzvHkbXE2xKAQ0Wwjgu7WI-tzm8BqoFGE0pWMeptNRaI4FynXXOGWNDpum8NEY6yGNoOUAX3d9NDO-tTY1aL5Oxda29zcEUcE4IYxWIjJ7_QVehjT6nyxTjAEMBPFPQUSaGlKJ1ahOXax13Coja96y6nlXuWe17VvsQtPOkzPoXG399_tf0Bdipglc
CODEN	IJPPE5
Cites_doi	10.1109/CLUSTR.2008.4663765 10.1109/71.89067 10.1109/MC.2006.180 10.1145/357153.357157 10.1109/12.48862 10.1145/1013208.1013209 10.1109/5.381846 10.1145/1017460.1017464 10.1109/PACT.2007.4336199 10.1145/1996130.1996168 10.1109/TC.1987.5009446 10.1145/384286.264189 10.1023/A:1008633809454 10.1145/1506409.1506426 10.1007/BFb0100636 10.1109/SIPS.2008.4671777 10.1109/ISCAS.2009.5117876 10.1109/TPDS.2007.1081 10.1109/GLOCOM.1989.64160 10.1109/ISCA.2006.31 10.1145/1088149.1088178 10.1145/1556444.1556449 10.1109/MICRO.1996.566464 10.1145/356683.356687 10.1145/1101868.1101877 10.1007/BF01608539 10.2172/5688849 10.1109/ICASSP.1992.226560 10.1109/2.303620 10.1109/ICASSP.1992.226558 10.1109/TC.2004.1261823 10.1109/PROC.1987.13876 10.1145/285930.286058 10.1007/BF01383830 10.1147/rd.111.0025 10.1109/MC.1980.1653418 10.1109/71.954629 10.1109/ISCAS.1989.100415 10.1145/342001.363382 10.1109/TC.1977.5009292 10.1109/SAMOS.2012.6404168 10.1109/MICRO.2002.1176241 10.1109/2.68 10.1109/DATE.2010.5456924 10.1109/78.485935
ContentType	Journal Article
Copyright	Springer Science+Business Media New York 2013 Springer Science+Business Media New York 2015
Copyright_xml	– notice: Springer Science+Business Media New York 2013 – notice: Springer Science+Business Media New York 2015
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 8AL 8FD 8FE 8FG 8FK 8FL 8G5 ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- L.- L.0 L7M L~C L~D M0C M0N M2O MBDVC P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI Q9U
DOI	10.1007/s10766-013-0277-2
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Research Library (Alumni Edition) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student Research Library Prep SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ABI/INFORM Professional Standard Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Research Library Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business (OCUL) ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic
DatabaseTitle	CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Research Library Prep Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College Research Library (Alumni Edition) ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ABI/INFORM Professional Standard ProQuest Central Korea ProQuest Research Library ProQuest Central (New) Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Business (Alumni) ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	ABI/INFORM Global (Corporate) Computer and Information Systems Abstracts
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1573-7640
EndPage	129
ExternalDocumentID	3560311191 10_1007_s10766_013_0277_2
Genre	Feature
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 199 1N0 2.D 203 28- 29J 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7WY 8FE 8FG 8FL 8G5 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYJJ AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDPE ABDZT ABECU ABFSI ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFO ACGFS ACHSB ACHXU ACIHN ACKNC ACMDZ ACMLO ACNCT ACOKC ACOMO ACPIV ACREN ACUHS ACZOJ ADHIR ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEAQA AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AOCGG ARAPS ARCSS ARMRJ AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BKOMP BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO E.L EAD EAP EAS EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW LAK LLZTM M0C M0N M2O M4Y MA- MS~ N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P62 P9O PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 Q2X QOK QOS R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TAE TEORI TN5 TSG TSK TSV TUC TUS U2A U5U UG4 UOJIU UTJUX UZXMN VC2 VFIZW VXZ W23 W48 WH7 WK8 YLTOR Z45 Z7R Z7X Z81 Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L.0 L7M L~C L~D MBDVC PKEHL PQEST PQUKI Q9U
ID	FETCH-LOGICAL-c371t-77cf68edbbe076a12a71ca221ef628e2eec8126abbe6644494a2b3cc8f1f1fc23
IEDL.DBID	M0C
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000348118600005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0885-7458
IngestDate	Sun Nov 09 12:32:55 EST 2025 Tue Nov 04 19:54:36 EST 2025 Sat Nov 29 07:57:11 EST 2025 Fri Feb 21 02:37:21 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Dataflow networks Compiling Multithreaded software Speculation Out-of-order
Language	English
License	http://www.springer.com/tdm
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c371t-77cf68edbbe076a12a71ca221ef628e2eec8126abbe6644494a2b3cc8f1f1fc23
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
PQID	1646119716
PQPubID	48389
PageCount	44
ParticipantIDs	proquest_miscellaneous_1660044517 proquest_journals_1646119716 crossref_primary_10_1007_s10766_013_0277_2 springer_journals_10_1007_s10766_013_0277_2
PublicationCentury	2000
PublicationDate	2015-02-01
PublicationDateYYYYMMDD	2015-02-01
PublicationDate_xml	– month: 02 year: 2015 text: 2015-02-01 day: 01
PublicationDecade	2010
PublicationPlace	Boston
PublicationPlace_xml	– name: Boston – name: New York
PublicationTitle	International journal of parallel programming
PublicationTitleAbbrev	Int J Parallel Prog
PublicationYear	2015
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	LiljaDReducing the branch penalty in pipelined processorsIEEE Comput.1988217475510.1109/2.68 Baudisch, D., Brandt, J., Schneider, K.: Dependency-driven distribution of synchronous programs. In: Hinchey, M., Kleinjohann, B., Kleinjohann, L., Lindsay, P., Rammig, F., Wolf, M. (eds.) Distributed and Parallel Embedded Systems (DIPES), pp. 169–180. International Federation for Information Processing (IFIP), Brisbane, Queensland, Australia (2010) ColwellRHallWJoshiCPapworthDRodmanPTomesJArchitecture and implementation of a VLIW supercomputer. Supercomputing1990New York, NY, USAIEEE Computer Society910919 Balakrishnan, S., Sohi, G.: Program demultiplexing: Data-flow based speculative parallelization of methods in sequential programs. In: International Symposium on Computer Architecture (ISCA), pp. 302–313. IEEE Computer Society, Boston, Massachusetts, USA (2006) LeeEThe problem with threadsIEEE. Comput.2006395334210.1109/MC.2006.180 TomasuloRAn efficient algorithm for exploiting multiple arithmetic unitsIBM J. Res. Dev.1967111253310.1147/rd.111.00250146.14604 Pérez, J., Badia, R., Labarta, J.: A dependency-aware task-based programming environment for multi-core architectures. In: International Conference on Cluster Computing (CLUSTER), pp. 142–151. IEEE Computer Society, Tsukuba, Japan (2008) Richardson, S.: Caching function results: Faster arithmetic by avoiding unnecessary computation. Technical Report SMLI TR-92-1, Sun Microsystems Inc., Mountain View, CA, USA (1992) Böhm, A., Oldehoeft, R., Cann, D., Feo, J.: SISAL 2.0 Reference Manual. Technical Report CS-91-118, Computer Science Department of Colorado State University (1991) MarcuelloPGonzálezASlootPBubakMHoekstraAHertzbergerBExploiting speculative thread-level parallelism on a SMT processorInternational Conference on High-Performance Computing and Networking (HPCN), LNCS1999Amsterdam, The NetherlandsSpringer75476310.1007/BFb0100636 LeeBHursonADataflow architectures and multithreadingIEEE. Comput.1994278273910.1109/2.303620 Bonfietti, A., Benini, L., Lombardi, M., Milano, M.: An efficient and complete approach for throughput-maximal SDF allocation and scheduling on multi-core platforms. Design, Automation and Test in Europe (DATE), pp. 897–902. EDA Consortium, Dresden, Germany (2010) MadrilesCLópezPCodinaJGibertELatorreFMartínezAMartínezRGonzálezAKecklerSBarrosoLBoosting single-thread performance in multi-core systems through fine-grain multi-threadingInternational Symposium on Computer Architecture (ISCA)2009Austin, TX, USAACM474483 RumbaughJA data flow multiprocessorIEEE Trans. Comput.197726213814610.1109/TC.1977.50092920348.68040 BaudischDBrandtJSchneiderKMcAllisterJBhattacharyyaSOut-of-order execution of synchronous data-flow networksInternational Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (ICSAMOS)2012Samos, GreeceIEEE Computer Society168175 Dennis, J., Misunas, D., Thiagarajan, P.: Data-flow computer architecture. Technical Report CSG-MEMO 104, MIT Lab for Computer Science, Cambridge, Massachusetts, USA (1974) Cintra, M., Martínez, J., Torrellas, J.: Architectural support for scalable speculative parallelization in shared-memory multiprocessors. International Symposium on Computer Architecture (ISCA), pp. 13–24. ACM, Vancouver, British Columbia, Canada (2000) Lipasti, M., Shen, J.: Exceeding the dataflow limit via value prediction. Microarchitecture (MICRO), pp. 226–237. IEEE Computer Society, Paris, France (1996) Roquier, G., Lucarz, C., Mattavelli, M., Wipliez, M., Raulet, M., Janneck, J., Miller, I., Parlour, D.: An integrated environment for HW/SW co-design based on a CAL specification and HW/SW code generators. In: International Symposium on Circuits and Systems (ISCAS), pp. 799–799. IEEE Computer Society, Taipei, Taiwan (2009) BhattacharyyaSBrebnerGJanneckJEkerJvon PlatenCMattavelliMRauletMOpenDF-a dataflow toolset for reconfigurable hardware and multicore systemsACM SIGARCH Comput. Archit. News2009365293510.1145/1556444.1556449 Nikhil, R.: Dataflow Programming Languages. Technical Report CSG-MEMO 333, Computer Science and Artificial Intelligence Laboratory, Cambridge, Massachusetts, USA (1991) Pajuelo, A., González, A., Valero, M.: Speculative execution for hiding memory latency. In: MEmory Performance: DEaling with Applications, Systems and Architecture (MEDEA), pp. 49–56. ACM, Antibes Juan-les-Pins, France (2004) SteinkeRNuttGA unified theory of shared memory consistencyJ. ACM200451580084910.1145/1017460.10174641204.681362147707 Gao, G., Govindarajan, R., Panangaden, P.: Well-behaved programs for DSP computation. International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 561–564. IEEE Computer Society, San Francisco, California, USA (1992) KaziILiljaDCoarse-grained thread pipelining—a speculative parallel execution model for shared-memory multiprocessorsIEEE Trans. Parallel Distrib. Syst200112995296610.1109/71.954629 LeeEComputing needs timeCommun. ACM (CACM)2009525707910.1145/1506409.1506426 HammondLWilleyMOlukotunKBhandarkarDAgarwalAData speculation support for a chip multiprocessorArchitectural Support for Programming Languages and Operating Systems (ASPLOS)1998San Jose, CA, USAACM5869 Lee, E.: Consistency in dataflow graphs. IEEE Trans. Parallel Distrib. Syst. 2(2) (1991) LeeEMesserschmittDSynchronous data flowProc. IEEE19877591235124510.1109/PROC.1987.13876 BaudischDBrandtJSchneiderKYeoSSVaidyaBPapadopoulosGTranslating synchronous systems to data-flow process networksParallel and Distributed Computing, Applications and Technologies (PDCAT)2011Gwangju, KoreaIEEE Computer Society354361 FisherJFaraboschiPYoungCEmbedded Computing: A VLIW Approach to Architecture. Compilers and Tools2005San FranciscoMorgan Kaufmann ColohanCAilamakiASteffanJMowryTCMP support for large and dependent speculative threadsIEEE Trans. Parallel Distrib. Syst.20071881041105410.1109/TPDS.2007.1081 McGrawJThe VAL language: description and analysisACM Trans. Program. Lang. Syst.198241448210.1145/357153.3571570479.68005 Genin, D., De Moortel, J., Desmet, D., van de Velde, E.: System design, optimization, and intelligent code generation for standard digital signal processors. International Symposium on Circuits and Systems (ISCAS), pp. 565–569. IEEE Computer Society, Portland, Oregon, USA (1989) McKenney, P.: Memory barriers: A hardware view for software hackers. http://www.rdrop.com/users/paulmck (2010) MarcuelloPGonzálezATubellaJThread partitioning and value prediction for exploiting speculative thread-level parallelismIEEE Trans. Comput.200453211412510.1109/TC.2004.1261823 ArvindNikhilRExecuting a program on the MIT tagged-token dataflow architectureIEEE Trans. Comput. (T-C)199039330031810.1109/12.48862 BhattacharyyaSLeeELooped schedules for dataflow descriptions of multirate signal processing algorithmsFormal Methods Syst. Des.19945318320510.1007/BF01383830 DennisJData flow supercomputersIEEE. Comput.19801311485610.1109/MC.1980.1653418 Powell, D., Lee, E., Newmann, W.: Direct synthesis of optimized DSP assembly from signal flow diagrams. In: International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 553–556. IEEE Computer Society, San Francisco, California, USA (1992) Schneider, K.: The synchronous programming language Quartz. Internal Report 375, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany (2009) RamamoorthyCLiHPipeline architectureACM Comput. Surv.1977916110210.1145/356683.3566870348.68038 Stulova, A., Leupers, R., Ascheid, G.: Throughput driven transformations of synchronous data flows for mapping to heterogeneous MPSoCs. In: McAllister, J., Bhattacharyya, S. (eds.) International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (ICSAMOS), pp. 144–151. IEEE Computer Society, Samos, Greece (2012) AllenJSoftware Synthesis from Dataflow Graphs1996DordrechtKluwer Dennis, J., Misunas, D.: A preliminary architecture for a basic data-flow processor. 25 Years of the International Symposia on Computer Architecture (ISCA), pp. 125–131. ACM, Barcelona, Spain (1998) Renau, J., Strauss, K., Ceze, L., Liu, W., Sarangi, S., Tuck, J., Torrellas, J.: Thread-level speculation on a CMP can be energy efficient. International Conference on Supercomputing (ICS), pp. 219–228. ACM, Cambridge, Massachusetts, USA (2005) Tejedor, E., Farreras, M., Grove, D., Almasi, G., Labarta, J.: ClusterSs: a task-based programming model for clusters. In: High Performance Distributed Computing (HPDC), pp. 267–268. ACM, San Jose, CA, USA (2011) Vachharajani, N., Rangan, R., Raman, E., Bridges, M., Ottoni, G., August, D.: Speculative decoupled software pipelining. Parallel Architectures and Compilation Techniques (PACT), pp. 49–59. IEEE Computer Society, Brasov, Romania (2007) MurthyPBhattacharyyaSLeeEJoint minimization of code and data for synchronous dataflow programsFormal Methods Syst. Des.1997111417010.1023/A:1008633809454 Buck, J., Lee, E.: The token flow model. In: Bic, L., Gao, G., Gaudiot, J.L. (eds.) Advanced Topics in Dataflow Computing and Multithreading, pp. 267–290. IEEE Computer Society, Hamilton Island, Queensland, Australia (1995) JohnstonWHannaJMillarRAdvances in dataflow programming languagesACM Comput. Surv. (CSUR)200436113410.1145/1013208.1013209 KahnGRosenfeldJThe semantics of a simple language for parallel programmingInformation Processing1974Stockholm, SwedenNorth-Holland471475 LeeEParksTDataflow process networksProc. IEEE199583577380110.1109/5.381846 Parks, T.: Bounded Scheduling of Process Networks. Ph.D. Thesis, Princeton University (1995) Zilles, C., Sohi, G.: Master/slave speculative parallelization. Microarchitecture (MICRO), pp. 85–96. IEEE Computer Society, Istanbul, Turkey (2002) BilsenGEngelsMLauwereinsRPeperstraeteJCyclo-static dataflowIEEE Trans. Sig. Process.199644239740810.1109/78.485935 Le Mentec, F., Gautier, T., Danjean, V.: The X-Kaapi’s application programming interface. part I: Data flow programming. Technical Report RT-0418, Institut National de Recherche en Informati C Madriles (277_CR41) 2009 S Bhattacharyya (277_CR8) 1992; 6 P Marcuello (277_CR42) 1999 L Hammond (277_CR24) 1998 S Bhattacharyya (277_CR9) 1994; 5 277_CR46 G Kahn (277_CR28) 1974 277_CR45 S Bhattacharyya (277_CR7) 2009; 36 277_CR40 R Colwell (277_CR16) 1990 W Johnston (277_CR27) 2004; 36 D Baudisch (277_CR6) 2012 E Lee (277_CR36) 1987; 36 R Steinke (277_CR59) 2004; 51 C Colohan (277_CR15) 2007; 18 R Tomasulo (277_CR62) 1967; 11 277_CR35 C Ramamoorthy (277_CR53) 1977; 9 277_CR32 277_CR30 J Fisher (277_CR21) 2005 I Kazi (277_CR29) 2001; 12 277_CR19 277_CR18 T Johnson (277_CR26) 2004 Arvind (277_CR2) 1990; 39 277_CR60 (277_CR1) 1996 277_CR61 E Lee (277_CR37) 1987; 75 277_CR25 E Lee (277_CR38) 1995; 83 D Baudisch (277_CR5) 2011 277_CR22 277_CR23 G Bilsen (277_CR11) 1996; 44 277_CR20 277_CR64 277_CR63 P Marcuello (277_CR43) 2004; 53 J Rumbaugh (277_CR57) 1977; 26 277_CR48 277_CR49 E Lee (277_CR34) 2009; 52 E Lee (277_CR33) 2006; 39 P Murthy (277_CR47) 1997; 11 J McGraw (277_CR44) 1982; 4 277_CR50 277_CR3 J Dennis (277_CR17) 1980; 13 277_CR13 B Lee (277_CR31) 1994; 27 277_CR14 277_CR58 277_CR55 277_CR12 277_CR56 277_CR4 277_CR10 277_CR54 D Lilja (277_CR39) 1988; 21 277_CR51 277_CR52
References_xml	– reference: Le Mentec, F., Gautier, T., Danjean, V.: The X-Kaapi’s application programming interface. part I: Data flow programming. Technical Report RT-0418, Institut National de Recherche en Informatique et en Automatique (INRIA) (2011) – reference: Vachharajani, N., Rangan, R., Raman, E., Bridges, M., Ottoni, G., August, D.: Speculative decoupled software pipelining. Parallel Architectures and Compilation Techniques (PACT), pp. 49–59. IEEE Computer Society, Brasov, Romania (2007) – reference: Tejedor, E., Farreras, M., Grove, D., Almasi, G., Labarta, J.: ClusterSs: a task-based programming model for clusters. In: High Performance Distributed Computing (HPDC), pp. 267–268. ACM, San Jose, CA, USA (2011) – reference: ColohanCAilamakiASteffanJMowryTCMP support for large and dependent speculative threadsIEEE Trans. Parallel Distrib. Syst.20071881041105410.1109/TPDS.2007.1081 – reference: MadrilesCLópezPCodinaJGibertELatorreFMartínezAMartínezRGonzálezAKecklerSBarrosoLBoosting single-thread performance in multi-core systems through fine-grain multi-threadingInternational Symposium on Computer Architecture (ISCA)2009Austin, TX, USAACM474483 – reference: Roquier, G., Lucarz, C., Mattavelli, M., Wipliez, M., Raulet, M., Janneck, J., Miller, I., Parlour, D.: An integrated environment for HW/SW co-design based on a CAL specification and HW/SW code generators. In: International Symposium on Circuits and Systems (ISCAS), pp. 799–799. IEEE Computer Society, Taipei, Taiwan (2009) – reference: McGrawJThe VAL language: description and analysisACM Trans. Program. Lang. Syst.198241448210.1145/357153.3571570479.68005 – reference: Pajuelo, A., González, A., Valero, M.: Speculative execution for hiding memory latency. In: MEmory Performance: DEaling with Applications, Systems and Architecture (MEDEA), pp. 49–56. ACM, Antibes Juan-les-Pins, France (2004) – reference: Schneider, K.: The synchronous programming language Quartz. Internal Report 375, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany (2009) – reference: KaziILiljaDCoarse-grained thread pipelining—a speculative parallel execution model for shared-memory multiprocessorsIEEE Trans. Parallel Distrib. Syst200112995296610.1109/71.954629 – reference: Genin, D., De Moortel, J., Desmet, D., van de Velde, E.: System design, optimization, and intelligent code generation for standard digital signal processors. International Symposium on Circuits and Systems (ISCAS), pp. 565–569. IEEE Computer Society, Portland, Oregon, USA (1989) – reference: JohnstonWHannaJMillarRAdvances in dataflow programming languagesACM Comput. Surv. (CSUR)200436113410.1145/1013208.1013209 – reference: TomasuloRAn efficient algorithm for exploiting multiple arithmetic unitsIBM J. Res. Dev.1967111253310.1147/rd.111.00250146.14604 – reference: MarcuelloPGonzálezASlootPBubakMHoekstraAHertzbergerBExploiting speculative thread-level parallelism on a SMT processorInternational Conference on High-Performance Computing and Networking (HPCN), LNCS1999Amsterdam, The NetherlandsSpringer75476310.1007/BFb0100636 – reference: Dennis, J., Misunas, D.: A preliminary architecture for a basic data-flow processor. 25 Years of the International Symposia on Computer Architecture (ISCA), pp. 125–131. ACM, Barcelona, Spain (1998) – reference: ArvindNikhilRExecuting a program on the MIT tagged-token dataflow architectureIEEE Trans. Comput. (T-C)199039330031810.1109/12.48862 – reference: McKenney, P.: Memory barriers: A hardware view for software hackers. http://www.rdrop.com/users/paulmck (2010) – reference: Stulova, A., Leupers, R., Ascheid, G.: Throughput driven transformations of synchronous data flows for mapping to heterogeneous MPSoCs. In: McAllister, J., Bhattacharyya, S. (eds.) International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (ICSAMOS), pp. 144–151. IEEE Computer Society, Samos, Greece (2012) – reference: LeeBHursonADataflow architectures and multithreadingIEEE. Comput.1994278273910.1109/2.303620 – reference: Cintra, M., Martínez, J., Torrellas, J.: Architectural support for scalable speculative parallelization in shared-memory multiprocessors. International Symposium on Computer Architecture (ISCA), pp. 13–24. ACM, Vancouver, British Columbia, Canada (2000) – reference: DennisJData flow supercomputersIEEE. Comput.19801311485610.1109/MC.1980.1653418 – reference: Powell, D., Lee, E., Newmann, W.: Direct synthesis of optimized DSP assembly from signal flow diagrams. In: International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 553–556. IEEE Computer Society, San Francisco, California, USA (1992) – reference: Moshovos, A., Breach, S., Vijaykumar, T., Sohi, G.: Dynamic speculation and synchronization of data dependences. In: International Symposium on Computer Architecture (ISCA), pp. 181–193 (1997) – reference: Baudisch, D., Brandt, J., Schneider, K.: Dependency-driven distribution of synchronous programs. In: Hinchey, M., Kleinjohann, B., Kleinjohann, L., Lindsay, P., Rammig, F., Wolf, M. (eds.) Distributed and Parallel Embedded Systems (DIPES), pp. 169–180. International Federation for Information Processing (IFIP), Brisbane, Queensland, Australia (2010) – reference: RamamoorthyCLiHPipeline architectureACM Comput. Surv.1977916110210.1145/356683.3566870348.68038 – reference: LeeEComputing needs timeCommun. ACM (CACM)2009525707910.1145/1506409.1506426 – reference: Richardson, S.: Caching function results: Faster arithmetic by avoiding unnecessary computation. Technical Report SMLI TR-92-1, Sun Microsystems Inc., Mountain View, CA, USA (1992) – reference: BhattacharyyaSLeeELooped schedules for dataflow descriptions of multirate signal processing algorithmsFormal Methods Syst. Des.19945318320510.1007/BF01383830 – reference: LeeEThe problem with threadsIEEE. Comput.2006395334210.1109/MC.2006.180 – reference: LeeEMesserschmittDSynchronous data flowProc. IEEE19877591235124510.1109/PROC.1987.13876 – reference: FisherJFaraboschiPYoungCEmbedded Computing: A VLIW Approach to Architecture. Compilers and Tools2005San FranciscoMorgan Kaufmann – reference: HammondLWilleyMOlukotunKBhandarkarDAgarwalAData speculation support for a chip multiprocessorArchitectural Support for Programming Languages and Operating Systems (ASPLOS)1998San Jose, CA, USAACM5869 – reference: AllenJSoftware Synthesis from Dataflow Graphs1996DordrechtKluwer – reference: BaudischDBrandtJSchneiderKYeoSSVaidyaBPapadopoulosGTranslating synchronous systems to data-flow process networksParallel and Distributed Computing, Applications and Technologies (PDCAT)2011Gwangju, KoreaIEEE Computer Society354361 – reference: BhattacharyyaSBrebnerGJanneckJEkerJvon PlatenCMattavelliMRauletMOpenDF-a dataflow toolset for reconfigurable hardware and multicore systemsACM SIGARCH Comput. Archit. News2009365293510.1145/1556444.1556449 – reference: Bonfietti, A., Benini, L., Lombardi, M., Milano, M.: An efficient and complete approach for throughput-maximal SDF allocation and scheduling on multi-core platforms. Design, Automation and Test in Europe (DATE), pp. 897–902. EDA Consortium, Dresden, Germany (2010) – reference: KahnGRosenfeldJThe semantics of a simple language for parallel programmingInformation Processing1974Stockholm, SwedenNorth-Holland471475 – reference: Lee, E.: Consistency in dataflow graphs. IEEE Trans. Parallel Distrib. Syst. 2(2) (1991) – reference: MurthyPBhattacharyyaSLeeEJoint minimization of code and data for synchronous dataflow programsFormal Methods Syst. Des.1997111417010.1023/A:1008633809454 – reference: JohnsonTEigenmannRVijaykumarTChambersCMin cut program decomposition for thread level speculationProgramming Language Design and Implementation (PLDI)2004Washington, DC, USAACM5970 – reference: Böhm, A., Oldehoeft, R., Cann, D., Feo, J.: SISAL 2.0 Reference Manual. Technical Report CS-91-118, Computer Science Department of Colorado State University (1991) – reference: Janneck, J., Miller, I., Parlour, D., Roquier, G., Wipliez, M., Raulet, M.: Synthesizing hardware from dataflow programs: An MPEG-4 simple profile decoder case study. Signal Processing Systems (SiPS), pp. 287–292. IEEE Computer Society, Washington, District of Columbia, USA (2008) – reference: BaudischDBrandtJSchneiderKMcAllisterJBhattacharyyaSOut-of-order execution of synchronous data-flow networksInternational Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (ICSAMOS)2012Samos, GreeceIEEE Computer Society168175 – reference: Engels, M., Bilsen, G., Lauwereins, R., Peperstraete, J.: Cyclo-static dataflow: Model and implementation. In: Asilomar Conference on Signals, Systems and Computers (ACSSC). IEEE Computer Society, Pacific Grove, California, USA (1994) – reference: Nikhil, R.: Dataflow Programming Languages. Technical Report CSG-MEMO 333, Computer Science and Artificial Intelligence Laboratory, Cambridge, Massachusetts, USA (1991) – reference: Renau, J., Strauss, K., Ceze, L., Liu, W., Sarangi, S., Tuck, J., Torrellas, J.: Thread-level speculation on a CMP can be energy efficient. International Conference on Supercomputing (ICS), pp. 219–228. ACM, Cambridge, Massachusetts, USA (2005) – reference: BhattacharyyaSLeeEScheduling synchronous dataflow graphs for efficient loopingJ. VLSI Sig. Process.19926327128810.1007/BF01608539 – reference: Pérez, J., Badia, R., Labarta, J.: A dependency-aware task-based programming environment for multi-core architectures. In: International Conference on Cluster Computing (CLUSTER), pp. 142–151. IEEE Computer Society, Tsukuba, Japan (2008) – reference: Lee, E., Ha, S.: Scheduling strategies for multiprocessor real-time DSP. In: Global Telecommunications Conference (GLOBECOM), pp. 1279–1283. IEEE Computer Society (1989) – reference: MarcuelloPGonzálezATubellaJThread partitioning and value prediction for exploiting speculative thread-level parallelismIEEE Trans. Comput.200453211412510.1109/TC.2004.1261823 – reference: Dennis, J., Misunas, D., Thiagarajan, P.: Data-flow computer architecture. Technical Report CSG-MEMO 104, MIT Lab for Computer Science, Cambridge, Massachusetts, USA (1974) – reference: LiljaDReducing the branch penalty in pipelined processorsIEEE Comput.1988217475510.1109/2.68 – reference: Zilles, C., Sohi, G.: Master/slave speculative parallelization. Microarchitecture (MICRO), pp. 85–96. IEEE Computer Society, Istanbul, Turkey (2002) – reference: LeeEMesserschmittDStatic scheduling of synchronous data flow programs for digital signal processingIEEE Trans. Comput.1987361243510.1109/TC.1987.50094460605.68024 – reference: BilsenGEngelsMLauwereinsRPeperstraeteJCyclo-static dataflowIEEE Trans. Sig. Process.199644239740810.1109/78.485935 – reference: Parks, T.: Bounded Scheduling of Process Networks. Ph.D. Thesis, Princeton University (1995) – reference: Gao, G., Govindarajan, R., Panangaden, P.: Well-behaved programs for DSP computation. International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 561–564. IEEE Computer Society, San Francisco, California, USA (1992) – reference: SteinkeRNuttGA unified theory of shared memory consistencyJ. ACM200451580084910.1145/1017460.10174641204.681362147707 – reference: ColwellRHallWJoshiCPapworthDRodmanPTomesJArchitecture and implementation of a VLIW supercomputer. Supercomputing1990New York, NY, USAIEEE Computer Society910919 – reference: Balakrishnan, S., Sohi, G.: Program demultiplexing: Data-flow based speculative parallelization of methods in sequential programs. In: International Symposium on Computer Architecture (ISCA), pp. 302–313. IEEE Computer Society, Boston, Massachusetts, USA (2006) – reference: Buck, J., Lee, E.: The token flow model. In: Bic, L., Gao, G., Gaudiot, J.L. (eds.) Advanced Topics in Dataflow Computing and Multithreading, pp. 267–290. IEEE Computer Society, Hamilton Island, Queensland, Australia (1995) – reference: RumbaughJA data flow multiprocessorIEEE Trans. Comput.197726213814610.1109/TC.1977.50092920348.68040 – reference: Lipasti, M., Shen, J.: Exceeding the dataflow limit via value prediction. Microarchitecture (MICRO), pp. 226–237. IEEE Computer Society, Paris, France (1996) – reference: LeeEParksTDataflow process networksProc. IEEE199583577380110.1109/5.381846 – ident: 277_CR52 doi: 10.1109/CLUSTR.2008.4663765 – ident: 277_CR32 doi: 10.1109/71.89067 – volume-title: Embedded Computing: A VLIW Approach to Architecture. Compilers and Tools year: 2005 ident: 277_CR21 – volume: 39 start-page: 33 issue: 5 year: 2006 ident: 277_CR33 publication-title: IEEE. Comput. doi: 10.1109/MC.2006.180 – volume: 4 start-page: 44 issue: 1 year: 1982 ident: 277_CR44 publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/357153.357157 – volume: 39 start-page: 300 issue: 3 year: 1990 ident: 277_CR2 publication-title: IEEE Trans. Comput. (T-C) doi: 10.1109/12.48862 – volume: 36 start-page: 1 issue: 1 year: 2004 ident: 277_CR27 publication-title: ACM Comput. Surv. (CSUR) doi: 10.1145/1013208.1013209 – start-page: 471 volume-title: Information Processing year: 1974 ident: 277_CR28 – volume: 83 start-page: 773 issue: 5 year: 1995 ident: 277_CR38 publication-title: Proc. IEEE doi: 10.1109/5.381846 – volume: 51 start-page: 800 issue: 5 year: 2004 ident: 277_CR59 publication-title: J. ACM doi: 10.1145/1017460.1017464 – ident: 277_CR63 doi: 10.1109/PACT.2007.4336199 – start-page: 474 volume-title: International Symposium on Computer Architecture (ISCA) year: 2009 ident: 277_CR41 – ident: 277_CR61 doi: 10.1145/1996130.1996168 – volume: 36 start-page: 24 issue: 1 year: 1987 ident: 277_CR36 publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1987.5009446 – ident: 277_CR46 doi: 10.1145/384286.264189 – volume: 11 start-page: 41 issue: 1 year: 1997 ident: 277_CR47 publication-title: Formal Methods Syst. Des. doi: 10.1023/A:1008633809454 – volume: 52 start-page: 70 issue: 5 year: 2009 ident: 277_CR34 publication-title: Commun. ACM (CACM) doi: 10.1145/1506409.1506426 – start-page: 754 volume-title: International Conference on High-Performance Computing and Networking (HPCN), LNCS year: 1999 ident: 277_CR42 doi: 10.1007/BFb0100636 – ident: 277_CR25 doi: 10.1109/SIPS.2008.4671777 – ident: 277_CR56 doi: 10.1109/ISCAS.2009.5117876 – volume: 18 start-page: 1041 issue: 8 year: 2007 ident: 277_CR15 publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2007.1081 – ident: 277_CR35 doi: 10.1109/GLOCOM.1989.64160 – ident: 277_CR3 doi: 10.1109/ISCA.2006.31 – ident: 277_CR54 doi: 10.1145/1088149.1088178 – volume: 36 start-page: 29 issue: 5 year: 2009 ident: 277_CR7 publication-title: ACM SIGARCH Comput. Archit. News doi: 10.1145/1556444.1556449 – ident: 277_CR40 doi: 10.1109/MICRO.1996.566464 – volume: 9 start-page: 61 issue: 1 year: 1977 ident: 277_CR53 publication-title: ACM Comput. Surv. doi: 10.1145/356683.356687 – ident: 277_CR19 – ident: 277_CR49 doi: 10.1145/1101868.1101877 – volume: 6 start-page: 271 issue: 3 year: 1992 ident: 277_CR8 publication-title: J. VLSI Sig. Process. doi: 10.1007/BF01608539 – start-page: 910 volume-title: Architecture and implementation of a VLIW supercomputer. Supercomputing year: 1990 ident: 277_CR16 – ident: 277_CR10 doi: 10.2172/5688849 – ident: 277_CR51 doi: 10.1109/ICASSP.1992.226560 – ident: 277_CR50 – volume-title: Software Synthesis from Dataflow Graphs year: 1996 ident: 277_CR1 – ident: 277_CR48 – volume: 27 start-page: 27 issue: 8 year: 1994 ident: 277_CR31 publication-title: IEEE. Comput. doi: 10.1109/2.303620 – ident: 277_CR4 – ident: 277_CR22 doi: 10.1109/ICASSP.1992.226558 – volume: 53 start-page: 114 issue: 2 year: 2004 ident: 277_CR43 publication-title: IEEE Trans. Comput. doi: 10.1109/TC.2004.1261823 – volume: 75 start-page: 1235 issue: 9 year: 1987 ident: 277_CR37 publication-title: Proc. IEEE doi: 10.1109/PROC.1987.13876 – ident: 277_CR18 doi: 10.1145/285930.286058 – volume: 5 start-page: 183 issue: 3 year: 1994 ident: 277_CR9 publication-title: Formal Methods Syst. Des. doi: 10.1007/BF01383830 – ident: 277_CR58 – start-page: 354 volume-title: Parallel and Distributed Computing, Applications and Technologies (PDCAT) year: 2011 ident: 277_CR5 – start-page: 58 volume-title: Architectural Support for Programming Languages and Operating Systems (ASPLOS) year: 1998 ident: 277_CR24 – ident: 277_CR30 – volume: 11 start-page: 25 issue: 1 year: 1967 ident: 277_CR62 publication-title: IBM J. Res. Dev. doi: 10.1147/rd.111.0025 – volume: 13 start-page: 48 issue: 11 year: 1980 ident: 277_CR17 publication-title: IEEE. Comput. doi: 10.1109/MC.1980.1653418 – volume: 12 start-page: 952 issue: 9 year: 2001 ident: 277_CR29 publication-title: IEEE Trans. Parallel Distrib. Syst doi: 10.1109/71.954629 – ident: 277_CR23 doi: 10.1109/ISCAS.1989.100415 – ident: 277_CR14 doi: 10.1145/342001.363382 – ident: 277_CR55 – start-page: 59 volume-title: Programming Language Design and Implementation (PLDI) year: 2004 ident: 277_CR26 – volume: 26 start-page: 138 issue: 2 year: 1977 ident: 277_CR57 publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1977.5009292 – ident: 277_CR60 doi: 10.1109/SAMOS.2012.6404168 – start-page: 168 volume-title: International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (ICSAMOS) year: 2012 ident: 277_CR6 – ident: 277_CR45 – ident: 277_CR64 doi: 10.1109/MICRO.2002.1176241 – ident: 277_CR20 – volume: 21 start-page: 47 issue: 7 year: 1988 ident: 277_CR39 publication-title: IEEE Comput. doi: 10.1109/2.68 – ident: 277_CR13 – ident: 277_CR12 doi: 10.1109/DATE.2010.5456924 – volume: 44 start-page: 397 issue: 2 year: 1996 ident: 277_CR11 publication-title: IEEE Trans. Sig. Process. doi: 10.1109/78.485935
SSID	ssj0009788
Score	1.9817165
Snippet	Dataflow process networks are a convenient formalism for implementing robust concurrent systems that has been successfully used for hardware and software... Issue Title: Special Issue on Embedded Computer Systems: Architectures, Modeling and Simulation Dataflow process networks are a convenient formalism for...
SourceID	proquest crossref springer
SourceType	Aggregation Database Index Database Publisher
StartPage	86
SubjectTerms	Analysis Benchmarks Computer networks Computer programming Computer programs Computer Science Embedded systems Energy consumption Formalism Hardware Microprocessors Networks Parallel processing Processor Architectures Programming languages Software Software Engineering/Programming and Operating Systems Studies Switching theory Synchronous Theory of Computation
SummonAdditionalLinks	– databaseName: Springer Journals New Starts & Take-Overs Collection dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT8MgFCdGPXhxfsbqNJh40pC0tAV6NLrF02Z0mt0aYJDs0pq18-O_99GPbRo9aHqEUvrg8X7kB--H0EUYmSjkipJQ-JJETGiSqDggXFqAA1QJP1GV2AQfDMR4nNw397iL9rR7S0lWK_XKZTfO3O634R1h3d2AaCecXsPD4_My0y6vxCbBe2LCo1i0VOZPTXwNRkuE-Y0UrWJNv_OvXu6g7QZa4ut6LuyiNZPtoU4r24AbL95Ho94iwzfOLXYK9I2GF55meDgvSW7J0KXkxL13KFtU_Mi0S6Wbzwt8K53sb_6GB_Ux8uIAPfV7o5s70ogrEB3yoARUrS0TZqKUgR7LgEoeaElpYCyjwlBjNMR-JqGcAWaKkkhSFWotbACPpuEhWs_yzBwhDJjGh7djKyMN6wFNDMAqq_xQSwBbeuKhy9bK6UudQyNdZkt29krBXqmzV0o91G3HIW3cqUhdEjTHdwbMQ-eLYnAEx27IzMCPQx3m2Ok44B66asdmpYnfPnj8p9onaAsgU1yf2-6i9XI2N6doU7-W02J2Vs3ET-E_2FU priority: 102 providerName: Springer Nature
Title	Evaluation of Speculation in Out-of-Order Execution of Synchronous Dataflow Networks
URI	https://link.springer.com/article/10.1007/s10766-013-0277-2 https://www.proquest.com/docview/1646119716 https://www.proquest.com/docview/1660044517
Volume	43
WOSCitedRecordID	wos000348118600005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: 7WY dateStart: 19970201 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: M0C dateStart: 19970201 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: P5Z dateStart: 19970201 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: K7- dateStart: 19970201 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: BENPR dateStart: 19970201 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Proquest Research Library customDbUrl: eissn: 1573-7640 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: M2O dateStart: 19970201 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVAVX databaseName: Springer Journals New Starts & Take-Overs Collection customDbUrl: eissn: 1573-7640 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009788 issn: 0885-7458 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZT-MwEB5xPezLci3aclRG4glkbeIcTp4QRxESoq24luUlclxH6ksCpOX498wkTgtI8LKKZCmyEyczHvuLZzIfwI7nG9-TqeBe5Cjuh5HmcRq4XKoM4YBIIydOK7IJ2e1Gt7dx3264lTasspkTq4l6UGjaI_9DebDI5eWG-_cPnFijyLtqKTRmYZ6QDYX0nTtH06S7suKdREMKuPSDqPFq1r_OyZC-pa0XU3xcl6Zg85N_tFp2Thb_94GX4KcFnOygHiHLMGPyFVhsyByYte1VuOpM8n6zImPES2-ZvdgwZ73xiBcZ71GiTtZ5wbpJw9dcU4LdYlyyY0VkwMUz69bB5eUvuD7pXB2dcku5wLUn3RFibZ2FkRmkqUH5KFco6WolhGuyUERGGKMREYQK60NEUn7sK5F6WkeZi4cW3hrM5UVufgNDpOPg1UGmfI2zhIgNKihLHU8rhGB60ILdRuDJfZ1ZI5nmUCbtJKidhLSTiBZsNkJOrJGVyVTCLdieVKN5kM9D5QZfHNuE5LMOXNmCvUaV727xVYfr33e4AT8QOQV1-PYmzI0ex2YLFvTTaFg-tmFW_v3XhvnDTrd_gWdnkrerkUml6GHZD-6wvLi8eQPXNOlJ
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bS8MwFD6ICvriXZzXCPqiBNf0kvRBRNxEmW6CE3yraZbCXtq5bk7_lL_Rk142FfTNB-lTSdqQ5pyTLz3J9wEc2I52bB4yaouqpI4nFPVD16JcRggHWCiqfpiJTfBmUzw--ndT8F6ehTHbKsuYmAXqTqLMP_ITw4NlUl6Wd9Z7pkY1ymRXSwmN3Cwa-m2ES7b09LqG43vI2GW9fXFFC1UBqmxuDRBOqsgTuhOGGtfw0mKSW0oyZunIY0IzrRVOep7Ecg_BguM7koW2UiKy8FKG6ABD_oxjC278qsHphOSXZzqX6Lgu5Y4ryixqflSPe2btXmRN2dd5cAJuv-Vjs2nucvG_faAlWCgANTnPPWAZpnS8AoulWAUpYtcqtOtjXnOSROS-l6kCZ7fdmLSGA5pEtGWISEn9FcvGFd9iZQiEk2FKatKIHScj0sw3z6dr8PAnfVuH6TiJ9QYQRHJVfNqNpKMwCjJfI5iMwqqtJEJM1anAUTnAQS9nDgkmHNHGGgK0hsBYQ8AqsF0OalAEkTSYjGgF9sfF6P4mpyNjjR3HOp7JybsWr8BxaTqfXvFTg5u_N7gHc1ft25vg5rrZ2IJ5RIluvlV9G6YH_aHegVn1Muim_d3MAwg8_bVFfQA-zkIF
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LSwMxEB5ERbz4Fuszgl6UYDf7yO5BRGyLpVILVihe1myagJfd6rY-_pq_zsk-WhX05kH2tCS7ITuTyTc7k28ADmxHOTaPGLX9qqCO50saRK5FudAIB1jkV4MoKzbB222_1ws6U_BenoUxaZWlTcwMdT-R5h_5ieHBMiEvyzvRRVpEp9Y4GzxSU0HKRFrLchq5irTU2wu6b-lps4ayPmSsUe9eXNKiwgCVNreGCC2l9nzVjyKF_rywmOCWFIxZSnvMV0wpiRugJ7DdQ-DgBI5gkS2lry28pCE9QPM_w9HHNOmEHfduQvjLs5qXuIhdyh3XLyOq-bE97hk_voigsq974gTofovNZlteY_E_f6wlWCiANjnPV8YyTKl4BRbLIhaksGmr0K2P-c5JosnNIKsWnN0-xOR6NKSJpteGoJTUX7Ft3PEtloZYOBmlpCZMEeTkhbTzpPp0DW7_ZG7rMB0nsdoAggivik-7WjgSrSMLFIJMHVVtKRB6yn4Fjkphh4OcUSSccEcbzQhRM0KjGSGrwHYp4LAwLmk4kW4F9sfNaBZMrEfECieOfTwTq3ctXoHjUo0-veKnATd_H3AP5lCRwqtmu7UF8wge3TyDfRumh08jtQOz8nn4kD7tZouBwP1fK9QHUqpLKQ
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Evaluation+of+Speculation+in+Out-of-Order+Execution+of+Synchronous+Dataflow+Networks&rft.jtitle=International+journal+of+parallel+programming&rft.au=Baudisch%2C+Daniel&rft.au=Schneider%2C+Klaus&rft.date=2015-02-01&rft.pub=Springer+Nature+B.V&rft.issn=0885-7458&rft.eissn=1573-7640&rft.volume=43&rft.issue=1&rft.spage=86&rft_id=info:doi/10.1007%2Fs10766-013-0277-2&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=3560311191
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0885-7458&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0885-7458&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0885-7458&client=summon