欢迎来到麦多课文档分享! | 帮助中心 海量文档,免费浏览,给你所需,享你所想!
麦多课文档分享
全部分类
  • 标准规范>
  • 教学课件>
  • 考试资料>
  • 办公文档>
  • 学术论文>
  • 行业资料>
  • 易语言源码>
  • ImageVerifierCode 换一换
    首页 麦多课文档分享 > 资源分类 > PDF文档下载
    分享到微信 分享到微博 分享到QQ空间

    ANSI INCITS337-2000 Information technology - High-Performance Parallel Interface - Scheduled Transfers (HIPPI-ST)《信息技术.高性能并行接口.预定转换(HIPPI-ST)》.pdf

    • 资源ID:436723       资源大小:608.26KB        全文页数:110页
    • 资源格式: PDF        下载积分:10000积分
    快捷下载 游客一键下载
    账号登录下载
    微信登录下载
    二维码
    微信扫一扫登录
    下载资源需要10000积分(如需开发票,请勿充值!)
    邮箱/手机:
    温馨提示:
    如需开发票,请勿充值!快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。
    如需开发票,请勿充值!如填写123,账号就是123,密码也是123。
    支付方式: 支付宝扫码支付    微信扫码支付   
    验证码:   换一换

    加入VIP,交流精品资源
     
    账号:
    密码:
    验证码:   换一换
      忘记密码?
        
    友情提示
    2、PDF文件下载后,可能会被浏览器默认打开,此种情况可以点击浏览器菜单,保存网页到桌面,就可以正常下载了。
    3、本站不支持迅雷下载,请使用电脑自带的IE浏览器,或者360浏览器、谷歌浏览器下载即可。
    4、本站资源下载后的文档和图纸-无水印,预览文档经过压缩,下载后原文更清晰。
    5、试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。

    ANSI INCITS337-2000 Information technology - High-Performance Parallel Interface - Scheduled Transfers (HIPPI-ST)《信息技术.高性能并行接口.预定转换(HIPPI-ST)》.pdf

    1、ANSI INCITS 337-2000(formerly ANSI NCITS 337-2000)for Information Technology Scheduled Transfer Protocol (ST)Copyright American National Standards Institute Provided by IHS under license with ANSI Not for ResaleNo reproduction or networking permitted without license from IHS-,-,-Copyright American N

    2、ational Standards Institute Provided by IHS under license with ANSI Not for ResaleNo reproduction or networking permitted without license from IHS-,-,-ANSI NCITS 337-2000 American National Standard for Information Technology Scheduled Transfer Protocol (ST) Secretariat Information Technology Industr

    3、y Council (ITI) Approved August 24, 2000 American National Standards Institute, Inc. Abstract This standard specifies a connection-oriented data transfer protocol supporting flow-controlled Read and Write sequences and non-flow-controlled, persistent-memory Put, Get and FetchOp sequences. For all se

    4、quences, small control messages are used to pre-allocate buffers at the data Destination before the data movement begins, thus allowing the data to be moved immediately from the physical network into the end devices memory. The control and data messages may use different physical media or may share

    5、a single physical medium. Procedures are provided for moving data over HIPPI and other media. Copyright American National Standards Institute Provided by IHS under license with ANSI Not for ResaleNo reproduction or networking permitted without license from IHS-,-,-American National Standard Publishe

    6、d by American National Standards Institute, Inc. 11 West 42nd Street, New York, NY 10036 Copyright 2000 by Information Technology Industry Council All rights reserved. No part of this publication may be reproduced in any form, in an electronic retrieval system or otherwise, without prior written per

    7、mission of the publisher. Printed in the United States of America Approval of an American National Standard requires review by ANSI that the require-ments for due process, consensus, and other criteria for approval have been met by the standards developer. Consensus is established when, in the judge

    8、ment of the ANSI Board of Standards Re-view, substantial agreement has been reached by directly and materially affected in-terests. Substantial agreement means much more than a simple majority, but not nec-essarily unanimity. Consensus requires that all views and objections be considered, and that a

    9、 concerted effort be made towards their resolution. The use of American National Standards is completely voluntary; their existence does not in any respect preclude anyone, whether he has approved the standards or not, from manufacturing, marketing, purchasing, or using products, processes, or proce

    10、-dures not conforming to the standards. The American National Standards Institute does not develop standards and will in no circumstances give an interpretation of any American National Standard. Moreover, no person shall have the right or authority to issue an interpretation of an American Na-tiona

    11、l Standard in the name of the American National Standards Institute. Requests for interpretations should be addressed to the secretariat or sponsor whose name ap-pears on the title page of this standard. CAUTION NOTICE: This American National Standard may be revised or withdrawn at any time. The pro

    12、cedures of the American National Standards Institute require that action be taken periodically to reaffirm, revise, or withdraw this standard. Purchasers of American National Standards may receive current information on all standards by call-ing or writing the American National Standards Institute.

    13、CAUTION: The developers of this standard have requested that holders of patents that may be required for the implementation of the standard disclose such patents to the publisher. However, neither the developers nor the publisher have undertaken a patent search in order to identify which, if any, pa

    14、tents may apply to this standard. As of the date of publication of this standard and following calls for the identification of patents that may be required for the implementation of the standard, no such claims have been made. No further patent search is conducted by the developer or publisher in re

    15、spect to any standard it processes. No representation is made or implied that li-censes are not required to avoid infringement in the use of this standard. Copyright American National Standards Institute Provided by IHS under license with ANSI Not for ResaleNo reproduction or networking permitted wi

    16、thout license from IHS-,-,-i Contents Page Foreword vi Introduction. x 1 Scope 1 2 Normative references . 1 3 Definitions and conventions 2 3.1 Definitions 2 3.2 Editorial conventions 4 3.2.1 Binary notation 4 3.2.2 Hexadecimal notation . 4 3.3 Acronyms and other abbreviations 4 4 System overview. 5

    17、 4.1 Control Channels, Control operations, Data Channels, and Data operations . 5 4.2 Virtual Connections 6 4.3 Data hierarchy . 6 4.4 Scheduled Transfers . 6 4.5 Persistent memory region 6 4.6 Destination side data structure model . 6 4.7 Implementing subsets of ST capabilities . 8 5 Connection man

    18、agement . 9 5.1 Connection management sequences 9 5.1.1 Virtual Connection setup. 9 5.1.2 Virtual Connection teardown. 10 5.2 Connection management parameters . 11 5.2.1 Ports . 11 5.2.2 Keys 11 5.2.3 ST Buffer Size and Bufsize. 12 5.2.4 Max_STU size 12 5.2.5 Slots 12 5.2.6 EtherType . 13 6 Data mov

    19、ement 13 6.1 Data movement sequences. 13 6.1.1 Common sequences. 13 6.1.1.1 Nop 14 6.1.1.2 Request Slot state . 14 6.1.1.3 Request Transfer state 14 6.1.1.4 Request Block state. 15 6.1.1.5 End sequence 16 6.1.2 Write sequence. 16 6.1.3 Read sequence. 19 6.1.4 Persistent memory sequences . 21 6.1.4.1

    20、 Allocate a persistent memory region . 22 6.1.4.2 Put sequences. 23 6.1.4.3 Get sequences 24 6.1.4.4 FetchOp sequences 25 6.2 Data movement parameters 26 6.2.1 Sequence identifiers (I-id, R-id) 26 Copyright American National Standards Institute Provided by IHS under license with ANSI Not for ResaleN

    21、o reproduction or networking permitted without license from IHS-,-,-iiPage 6.2.2 Blocks .27 6.2.3 Block numbers (B_num, F_num, G_num)27 6.2.4 Block numbers in state responses (B_num, B_seq) 28 6.2.5 Maximum Block size (Max_Block)28 6.2.6 Block size28 6.2.6.1 Consistent Block sizes (2Blocksize) .29 6

    22、.2.6.2 Variable Block sizes (V-BlkSize)29 6.2.7 Blocks enabled (CTS_req) .29 6.2.8 STUs and STU_num 30 6.2.9 Bufx.30 6.2.10 Offset 30 6.2.10.1 Buffer-referenced (Offset, F-Offset) 30 6.2.10.2 Transfer-referenced (V-ByteSeq) 31 6.2.11 Transfer length (T_len) .31 6.2.12 Sync31 6.2.13 Memory Index (Mx)

    23、.31 6.2.14 Opaque data .32 6.2.15 Block window (B_winreq, B_win)32 6.3 Tiling examples32 7 Operations management 35 7.1 Flow control .35 7.2 Status operations.35 7.3 Rejected operations.35 7.4 Interrupts35 8 Schedule Header 35 8.1 Op codes .36 8.2 Flags 36 8.3 Checksum (optional)37 8.3.1 Checksum al

    24、gorithm.37 8.3.2 Transmitting checksums.38 8.3.3 Receiving checksums.38 8.3.4 Data checksum example 38 9 Operations sequence tables.39 10 Error processing .43 10.1 Operation timeout 43 10.2 Operation pairs 43 10.3 Data transmission timeouts .43 10.4 Keep-alive sequences (optional) .44 10.5 Duplicate

    25、d operations 44 10.5.1 Duplicate Request_Connection 45 10.5.2 Duplicate Connection_Answer45 10.5.3 Duplicate Request_Disconnect.45 10.5.4 Duplicate Disconnect_Answer45 10.5.5 Duplicate End .46 10.5.6 Duplicate Request_State 46 10.5.7 Duplicate Request_To_Send46 10.5.8 Duplicate Request_To_Receive .4

    26、6 10.5.9 Duplicate Clear_To_Send.46 10.5.10 Duplicate Request_Memory_Region 46 Copyright American National Standards Institute Provided by IHS under license with ANSI Not for ResaleNo reproduction or networking permitted without license from IHS-,-,-iii Page 10.5.11 Duplicate Get47 10.5.12 Duplicate

    27、 FetchOp47 10.5.13 Duplicate Data for a FetchOp .47 10.5.14 Other duplicate operations48 10.6 Checksum errors .48 10.7 LLP error48 10.8 Syntax errors .48 10.8.1 Undefined Opcode48 10.8.2 Unexpected Opcode.48 10.9 Virtual Connection errors.48 10.9.1 Invalid Key or Port.48 10.9.2 Slots exceeded .48 10

    28、.9.3 Unknown EtherType .48 10.9.4 Illegal Bufsize49 10.9.5 Illegal STU size.49 10.10 Scheduled Transfer errors.49 10.10.1 Invalid sequence identifier 49 10.10.2 Invalid Memory Index (Mx) .49 10.10.3 Bad Data Channel specification49 10.10.4 Out of Range B_num, Bufx, Offset, or STU_num 49 10.10.5 Bloc

    29、k out of order error.49 10.10.6 Missing or flawed Block recovery .49 10.10.7 Illegal Blocksize 50 10.10.8 Undefined Flag .50 10.10.9 Unsupported sequence error50 Tables 1 Response to a rejected operation 35 2 Op codes and operations. 36 3 Connection management sequences 40 4 Common control sequences

    30、 40 5 Write sequences 41 6 Read sequences 41 7 Put, Get, and FetchOp sequences 42 8 Operation pairs guarded by Op_timeout with retry 43 9 Summary of logged errors . 50 B.1 Defined option-codes. 58 D.1 Transfer example operations. 69 D.2 Anti-aliasing tools summary. 76 E.1 State table syntax 77 E.2 C

    31、onnection setup example 80 E.3 Connection teardown example 80 E.4 Write sequence example. 83 E.5 Persistent memory region setup example . 86 E.6 Persistent memory region teardown example . 86 E.7 Put sequence example 88 E.8 Get sequence example 88 E.9 FetchOp sequence example 89 E.10 Connection mana

    32、gement FSM 90 E.11 Write sequence (Initiator side) FSM 91 E.12 Write sequence (Responder side) FSM 92 E.13 Persistent memory region (Initiator side) FSM 93 Copyright American National Standards Institute Provided by IHS under license with ANSI Not for ResaleNo reproduction or networking permitted wi

    33、thout license from IHS-,-,-ivPage E.14 Persistent memory region (Responder side) FSM.94 E.15 Acknowledged Put sequence (Initiator side) FSM .95 E.16 Get sequence (Initiator side) FSM .95 E.17 FetchOp sequence (Initiator side) FSM .96 E.18 FetchOp sequence (Responder side) FSM .96 Figures 1 System ov

    34、erview5 2 Transmission units.5 3 User data hierarchy6 4 A Destination side data structure model 7 5 Connection management example9 6 Common sequence examples .13 7 Write example17 8 Read example19 9 Put, Get, and FetchOp examples 22 10 Consistent Block size data tiling example34 11 Schedule Header c

    35、ontents.35 12 Flags summary 36 13 Data checksum example .39 A.1 An ST operation carried in a HIPPI-6400-PH Message.52 A.2 An ST operation carried in a HIPPI-FP packet 53 A.3 An ST operation carried in an IEEE 802.3 Ethernet packet.55 A.4 An ST operation carried in a DIX Ethernet packet.56 B.1 Option

    36、 formats .58 C.1 ST striping configurations 61 D.1 Maximum STU size determination.63 D.2 Maximum Block size determination and pacing Clear_To_Send operations 65 D.3 Example of a data Destinations Validation Table lookup67 D.4 Ks buffer layout .68 Annexes A Using lower layer protocols .51 A.1 HIPPI-6

    37、400-PH as the LLP .51 A.2 HIPPI-FP as the LLP .52 A.3 Ethernet as the LLP.54 A.4 ATM LAN Emulation as the LLP57 B Option payload format58 B.1 Option formats.58 B.2 Option-codes .58 B.2.1 End of list58 B.2.2 No_operation58 B.2.3 Linear address base.58 B.2.4 ULP parameter.59 B.2.5 ASCII error string59

    38、 B.2.6 Two-byte error code .59 B.2.7 V-BlkSize and V-ByteSeq.59 B.2.8 Experimental 59 C ST striping60 Copyright American National Standards Institute Provided by IHS under license with ANSI Not for ResaleNo reproduction or networking permitted without license from IHS-,-,-v Page C.1 Striping princip

    39、les 60 C.2 Many-to-one striping . 60 C.3 One-to-many striping. 60 C.4 Many-to-many striping. 61 D Implementation comments. 62 D.1 Parameters expressed as 2n. 62 D.2 Using Max_STU and Bufsize to determine the maximum STU size. 62 D.3 Using Max_Block, Blocksize, and pacing Clear_To_Send operations . 6

    40、4 D.4 Implementing Bufx lookups. 66 D.5 Transfer example 68 D.5.1 End device assumptions 68 D.5.2 Interconnection assumptions . 68 D.5.3 Notes for table D.1 . 70 D.5.4 Parameter notes 70 D.6 FetchOp buffer management 72 D.7 V-BlkSize and V-ByteSeq comments 73 D.8 Put Block window comments 74 D.9 Ali

    41、ased operations. 75 E State tables 77 E.1 Introduction 77 E.1.1 Table syntax . 77 E.1.2 Conventions in FSMs . 78 E.2 General implementation issues. 78 E.3 Connection management FSM . 79 E.3.1 FSM interface to ULP assumptions 79 E.3.2 Implementation Issues . 79 E.3.3 Connection management examples 80

    42、 E.3.4 Connection management error examples 81 E.4 Write sequence FSMs. 82 E.4.1 Assumptions. 82 E.4.2 Implementation issues . 82 E.4.3 FSM interface to ULP assumptions 82 E.4.4 Write sequence example . 83 E.4.5 Write sequence error examples. 84 E.5 Read sequence FSMs. 84 E.6 Persistent memory regio

    43、n FSMs. 85 E.6.1 Assumptions. 85 E.6.2 Implementation issues . 85 E.6.3 FSM interface to ULP assumptions 85 E.6.4 Persistent memory region examples 85 E.6.5 Persistent memory region error examples . 87 E.7 Put, Get, and FetchOp examples 87 E.7.1 Put example . 87 E.7.2 Get example. 88 E.7.3 FetchOp e

    44、xample. 89 Copyright American National Standards Institute Provided by IHS under license with ANSI Not for ResaleNo reproduction or networking permitted without license from IHS-,-,-viForeword (This foreword is not part of American National Standard ANSI NCITS 337-2000.) This American National Stand

    45、ard specifies a connection-oriented data transfer pro-tocol supporting flow-controlled Read and Write sequences and non-flow-controlled, persistent-memory Put, Get and FetchOp sequences. For all sequences, small con-trol messages are used to pre-allocate buffers at the data Destination before the da

    46、ta movement begins, thus allowing the data to be moved immediately from the physical network into the end devices memory. The control and data messages may use different physical media or may share a single physical medium. Proce-dures are provided for moving data over HIPPI and other media. This do

    47、cument includes annexes which are informative and are not considered part of the standard. Requests for interpretation, suggestions for improvement or addenda, or defect re-ports are welcome. They should be sent to the National Committee for Information Technology Standards, 1250 Eye Street, NW, Sui

    48、te 200, Washington, DC 20005. This standard was processed and approved for submittal to ANSI by NCITS. Committee approval of the standard does not necessarily imply that all committee members voted for approval. At the time it approved this standard, NCITS had the following members: Karen Higginbott

    49、om, Chair David Michael, Vice-Chair Monica Vago, Secretary Organization Represented Name of Representative Apple Computer, Inc.David Michael Wanda Cox (Alt.) Bull HN Information Systems, Inc.Randall Kilmartin Compaq Computer Corporation .Scott Jameson Stephen Heil (Alt.) Hewlett-Packard Company.Karen Higginbottom Wendy Fong (A


    注意事项

    本文(ANSI INCITS337-2000 Information technology - High-Performance Parallel Interface - Scheduled Transfers (HIPPI-ST)《信息技术.高性能并行接口.预定转换(HIPPI-ST)》.pdf)为本站会员(ideacase155)主动上传,麦多课文档分享仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知麦多课文档分享(点击联系客服),我们立即给予删除!




    关于我们 - 网站声明 - 网站地图 - 资源地图 - 友情链接 - 网站客服 - 联系我们

    copyright@ 2008-2019 麦多课文库(www.mydoc123.com)网站版权所有
    备案/许可证编号:苏ICP备17064731号-1 

    收起
    展开