消息缓冲 meaning in English
message buffer
Examples
- After studying several implementation mechanisms , we designed and implemented a page - based message storage management system named ismqsm . ismqsm provides volatile queue , persistent queue and transactional queue to satisfy several levels " reliability and efficiency requirements . to assure operation ' s atomicity and storage ' s consistency and integrity , ismqsm supports transaction and sub - transaction
Ismqsm提供内存队列、持久队列和事务队列三种消息缓冲机制，能满足不同级别可靠性和操作效率的需求； ismqsm采用页式管理消息和队列，以提高存储利用率； ismqsm还提供了事务恢复，支持用户级事务，并且使用内部子事务来实现关键数据操作，以保证消息存储的完整性和一致性。 - Abstract : in a network system , overflow or overwrite of message buffer will cause missing of messages . for a timed token network , message transmission time and the message buffering space allocation in a node are very important issues on network real time capability . this paper analyses the message buffering mechanism , describes the relationship of message buffering space and message transmission bandwidth allocation , and proposes a space determination method of message buffer for ltpb network . the maximum space redundancy avoiding buffer overflow for “ send ” and “ receive ” buffers has been derived . it is found that the space of “ send ” and “ receive ” buffers is equal to the message size under condition that the message gap time is greater than message latency and node response time
文摘:在网络系统中，节点缓冲区内消息发生覆盖或溢出会造成消息的丢失，对于限时令牌网络，节点消息发送时间和消息缓冲容量的分配是影响消息实时性的重要因素.针对令牌传递网络分析了节点消息缓冲机制，说明了消息缓冲容量的确定与网络带宽分配方法的关系，并提出了消息缓冲容量的确定方法，导出了避免消息覆盖或溢出所需的最大发送和接收缓冲容量余度.指出在消息的产生间隔大于该消息的最大允许的延迟时间和接收节点响应时间的条件下，发送和接收端的消息缓冲容量等于被缓冲消息的长度 - In a network system , overflow or overwrite of message buffer will cause missing of messages . for a timed token network , message transmission time and the message buffering space allocation in a node are very important issues on network real time capability . this paper analyses the message buffering mechanism , describes the relationship of message buffering space and message transmission bandwidth allocation , and proposes a space determination method of message buffer for ltpb network . the maximum space redundancy avoiding buffer overflow for “ send ” and “ receive ” buffers has been derived . it is found that the space of “ send ” and “ receive ” buffers is equal to the message size under condition that the message gap time is greater than message latency and node response time
在网络系统中，节点缓冲区内消息发生覆盖或溢出会造成消息的丢失，对于限时令牌网络，节点消息发送时间和消息缓冲容量的分配是影响消息实时性的重要因素.针对令牌传递网络分析了节点消息缓冲机制，说明了消息缓冲容量的确定与网络带宽分配方法的关系，并提出了消息缓冲容量的确定方法，导出了避免消息覆盖或溢出所需的最大发送和接收缓冲容量余度.指出在消息的产生间隔大于该消息的最大允许的延迟时间和接收节点响应时间的条件下，发送和接收端的消息缓冲容量等于被缓冲消息的长度