Article

Free access

Multipath execution: opportunities and limits

Authors:

Pritpal S. Ahuja,

Kevin Skadron,

Margaret Martonosi,

Douglas W. ClarkAuthors Info & Claims

ICS '98: Proceedings of the 12th international conference on Supercomputing

Pages 101 - 108

https://doi.org/10.1145/277830.277854

Published: 13 July 1998 Publication History

PDF eReader

References

[1]

D. Burger, T. M. Austin, and S. Bennett. Evaluating future microprocessors: the SimpleScalar tool set. Tech. Report TR-1308, Univ. of Wisconsin-Madison Computer Sciences Dept., July 1996.

Google Scholar

[2]

I.-C. Chen, J. T. Coffey, and T. N. Mudge. Analysis of branch prediction via data compression. In Proc. ASPLOS-VII, pages 128-37, Oct. 1996.

Digital Library

Google Scholar

[3]

L. Gwennap. Digital 21264 sets new standard. Microprocessor Report, pages 11-16, Oct. 28, 1996.

Google Scholar

[4]

T.H. Heil and J. E. Smith. Selective dual path execution. Tech. report, Univ. of Wisconsin-Madison Dept. of Elec. & Comp. Eng., Nov. 1996.

Google Scholar

[5]

S. Hily and A. Seznec. Branch prediction and simultaneous multithreading. In Proc. PACT '96, pages 169-73, Oct. 1996.

Digital Library

Google Scholar

[6]

E. Jacobsen, E. Rotenberg, and J. E. Smith. Assigning confidence to conditional branch predictions. In Proc. Micro-29, pages 142-52, Dec. 1996.

Digital Library

Google Scholar

[7]

S. Jourdan, J. Stark, T.-H. Hsing, and Y. N. Patt. Recovery requirements of branch prediction storage structures in the presence of mispredicted-path execution, lnt'l J. Parallel Programming, 25(5):363-83, Oct. 1997.

Digital Library

Google Scholar

[8]

A. Klauser, V. Paithankar, and D. Grunwald. Selective eager execution on the PolyPath Architecture. In Proc. ISCA 25, July 1998.

Digital Library

Google Scholar

[9]

J. Laudon, A. Gupta, and M. Horowitz. Interleaving: A multithreading technique targeting multiprocessors and workstations. In Proc. ASPLOS-IV, pages 308-318, Oct. 1994.

Digital Library

Google Scholar

[10]

S. McFarling. Combining branch predictors. Tech. Note TN-36, DEC WRL, June 1993.

Google Scholar

[11]

J. Pierce and T. Mudge. Wrong-path instruction prefetching. In Proc. Micro-29, pages 165-75, Dec. 1996.

Digital Library

Google Scholar

[12]

K. Skadron, P. S. Ahuja, M. Martonosi, and D. W. Clark. Improving prediction for procedure returns with return-address-stack repair mechanisms. Tech. Report TR-577-98, Princeton Dept. of Comp. Sci., Mar. 1998.

Google Scholar

[13]

K. Skadron, P. S. Ahuja, M. Martonosi, and D. W. Clark. Tradeoffs among branch prediction, instruction-window size, and cache size. Tech. Report TR-578-98, Princeton Dept. of Comp. Sci., April 1998.

Google Scholar

[14]

T.-Y. Teh and Y. N. Patt. A comparison of dynamic branch predictors that use two levels of branch history, in Proc. 1SCA-20, pages 257-66, May 1993.

Digital Library

Google Scholar

[15]

D. Tullsen, S. Eggers, J. Emer, et al. Exploiting choice: Instruction fetch and issue on an implementable simultaneous multitheading processor. In Proc. ISCA-23, May 1996.

Digital Library

Google Scholar

[16]

G. Tyson, K. Lick, and M. Farrens. Limited dual path execution. Tech. Report CSE-TR-346-97, University of Michigan, EECS Dept., 1991.

Google Scholar

[17]

A. Uht and V. Sindagi. Disjoint eager execution: An optimal form of speculative execution. In Proc. Micro-28, pages 313-25, Dec. 1995.

Digital Library

Google Scholar

[18]

S. Wallace, B. Calder, and D. M. Tullsen. Threaded multiple path execution. In Proc. iSCA 25, July 1998.

Digital Library

Google Scholar

Cited By

View all

Qiu JSun XSabet AZhao ZSherwood TBerger EKozyrakis C(2021)Scalable FSM parallelization via path fusion and higher-order speculationProceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3445814.3446705(887-901)Online publication date: 19-Apr-2021
https://dl.acm.org/doi/10.1145/3445814.3446705
Chauhan AGaur JSperber ZSala FRappoport LYoaz ASubramoney SMartínez JDuato JEeckhout L(2020)Auto-predication of critical branchesProceedings of the ACM/IEEE 47th Annual International Symposium on Computer Architecture10.1109/ISCA45697.2020.00019(92-104)Online publication date: 30-May-2020
https://dl.acm.org/doi/10.1109/ISCA45697.2020.00019
Xekalakis PIoannou NCintra M(2012)Mixed speculative multithreaded execution modelsACM Transactions on Architecture and Code Optimization10.1145/2355585.23555919:3(1-26)Online publication date: 5-Oct-2012
https://dl.acm.org/doi/10.1145/2355585.2355591
Show More Cited By

Index Terms

Multipath execution: opportunities and limits

Recommendations

Multipath QUIC: Design and Evaluation
CoNEXT '17: Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies

Quick UDP Internet Connection (QUIC) is a recent protocol initiated by Google that combines the functions of HTTP/2, TLS, and TCP directly over UDP, with the goal to reduce the latency of client-server communication. It can replace the traditional HTTP/...
Evaluating TCP-friendliness in light of Concurrent Multipath Transfer

In prior work, a CMT protocol using SCTP multihoming (termed SCTP-based CMT) was proposed and investigated for improving application throughput. SCTP-based CMT was studied in (bottleneck-independent) wired networking scenarios with ns-2 simulations. ...
Observing real Multipath TCP traffic

We analyse a Multipath TCP dataset collected from multipath-tcp.org consecutively in 5 months.Multipath TCP correctly passes through a wide range of Internet paths.Current implementations of Multipath TCP try to utilise additional paths as quickly as ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICS '98: Proceedings of the 12th international conference on Supercomputing

July 1998

464 pages

ISBN:089791998X

DOI:10.1145/277830

Chairmen:
Greg Egan
Monash Univ.
,
Richard Brent
Oxford Univ.; and Australian National Univ., Canberra, Australia
,
Dennis Gannon
Indiana Univ.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 July 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS98

Sponsor:

SIGARCH
IEEE-CS

ICS98: 1998 International Conference on Supercomputing

Melbourne, Australia

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
501
Total Downloads

Downloads (Last 12 months)60
Downloads (Last 6 weeks)11

Reflects downloads up to 25 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Qiu JSun XSabet AZhao ZSherwood TBerger EKozyrakis C(2021)Scalable FSM parallelization via path fusion and higher-order speculationProceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3445814.3446705(887-901)Online publication date: 19-Apr-2021
https://dl.acm.org/doi/10.1145/3445814.3446705
Chauhan AGaur JSperber ZSala FRappoport LYoaz ASubramoney SMartínez JDuato JEeckhout L(2020)Auto-predication of critical branchesProceedings of the ACM/IEEE 47th Annual International Symposium on Computer Architecture10.1109/ISCA45697.2020.00019(92-104)Online publication date: 30-May-2020
https://dl.acm.org/doi/10.1109/ISCA45697.2020.00019
Xekalakis PIoannou NCintra M(2012)Mixed speculative multithreaded execution modelsACM Transactions on Architecture and Code Optimization10.1145/2355585.23555919:3(1-26)Online publication date: 5-Oct-2012
https://dl.acm.org/doi/10.1145/2355585.2355591
Ghandour WAkkary HMasri W(2012)Leveraging Strength-Based Dynamic Information Flow Analysis to Enhance Data Value PredictionACM Transactions on Architecture and Code Optimization10.1145/2133382.21333839:1(1-33)Online publication date: 1-Mar-2012
https://dl.acm.org/doi/10.1145/2133382.2133383
Puiggali JSzymanski BJové TMarzo J(2012)Dynamic branch speculation in a speculative parallelization architecture for computer clustersConcurrency and Computation: Practice and Experience10.1002/cpe.287225:7(932-960)Online publication date: 29-Jun-2012
https://doi.org/10.1002/cpe.2872
Uht A(2010)Multipath ExecutionSpeculative Execution in High Performance Computer Architectures10.1201/9781420035155.ch6(135-160)Online publication date: 14-Jan-2010
https://doi.org/10.1201/9781420035155.ch6
Ghandour WAkkary HMasri WSalapura VGschwind MKnoop J(2010)The potential of using dynamic information flow analysis in data value predictionProceedings of the 19th international conference on Parallel architectures and compilation techniques10.1145/1854273.1854327(431-442)Online publication date: 11-Sep-2010
https://dl.acm.org/doi/10.1145/1854273.1854327
Tian CFeng MGupta R(2010)Speculative parallelization using state separation and multiple value predictionACM SIGPLAN Notices10.1145/1837855.180666345:8(63-72)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1837855.1806663
Tian CFeng MGupta RVitek JLea D(2010)Speculative parallelization using state separation and multiple value predictionProceedings of the 2010 international symposium on Memory management10.1145/1806651.1806663(63-72)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1806651.1806663
Xekalakis PCintra M(2010)Handling branches in TLS systems with Multi-Path ExecutionHPCA - 16 2010 The Sixteenth International Symposium on High-Performance Computer Architecture10.1109/HPCA.2010.5416632(1-12)Online publication date: Jan-2010
https://doi.org/10.1109/HPCA.2010.5416632
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Multipath QUIC: Design and Evaluation

Evaluating TCP-friendliness in light of Concurrent Multipath Transfer

Observing real Multipath TCP traffic