公开(公告)号：US06829769B2

公开(公告)日：2004-12-07

申请号：US09823124

申请日：2001-03-30

申请人： Wayne M. Cranston ,  Min-Yu Yang ,  Michael J. Purtell

发明人： Wayne M. Cranston ,  Min-Yu Yang ,  Michael J. Purtell

IPC分类号： G06F946

CPC分类号： G06F9/544

摘要： Methods, systems, and computer program products for high-performance interprocess communication. Each process dynamically identifies routines responsible for managing communication received from other processes through a shared memory heap and a shared memory queue, each of the routines handling one or more operation codes. An allocation from the shared heap produces a process agnostic memory handle from which a process specific memory pointer may be obtained. Using the memory pointer, the enqueuing process places an operation code, parameters, and any other relevant data in the allocated memory and adds the memory handle to a shared queue. The dequeuing process removes the memory handle from the queue and generates a memory pointer to access the allocated memory in the dequeuing process. Upon retrieving the operation code from the allocated memory, the dequeuing process calls the appropriate handler routine. Enqueues may be registered to account for expected responses that are not received.

摘要翻译： 用于高性能进程间通信的方法，系统和计算机程序产品。 每个过程动态地标识负责管理通过共享存储器堆和共享存储器队列从其他进程接收的通信的例程，每个例程处理一个或多个操作代码。 来自共享堆的分配产生一个进程不可知的内存句柄，从中可以获取进程特定的内存指针。 使用内存指针，入队进程将操作代码，参数和任何其他相关数据放入分配的内存中，并将内存句柄添加到共享队列中。 出队进程从队列中删除内存句柄，并生成一个内存指针，以在出队进程中访问分配的内存。 在从分配的存储器检索操作代码时，出队进程调用适当的处理程序例程。 入队可能被注册，以解决未收到的预期响应。

公开(公告)号：US07743104B2

公开(公告)日：2010-06-22

申请号：US10927699

申请日：2004-08-27

申请人： Alexander R. Wetmore ,  Malcolm E. Pearson ,  Wayne M. Cranston

发明人： Alexander R. Wetmore ,  Malcolm E. Pearson ,  Wayne M. Cranston

IPC分类号： G06F15/177

CPC分类号： H04L29/12009 ,  H04L29/12132 ,  H04L29/12594 ,  H04L51/14 ,  H04L51/28 ,  H04L61/1552 ,  H04L61/307

摘要： The present invention provides for a messaging system that automatically identifies a forest that corresponds to a particular recipient of a message, without using a common or unified directory that maps forests with recipients. In a network with multiple forests, each forest having multiple recipients, when a message is received at a message server with a destination address that does not uniquely identify a particular forest, the present invention provides for using a standard messaging protocol for querying each forest. The forests respond with status codes that indicate whether or not a recipient associated with the destination address corresponds to the forest being queried. If a status code indicates that the recipient corresponds to the particular forest, information may be stored and used to quarry that particular forest first, before querying other forests within the network.

摘要翻译： 本发明提供了一种自动识别与消息的特定接收者相对应的森林的消息系统，而不使用将森林与接收者映射的公共或统一目录。 在具有多个林的网络中，每个林具有多个收件人，当在具有不唯一标识特定林的目的地地址的消息服务器上接收到消息时，本发明提供了使用标准消息传递协议来查询每个森林。 森林响应状态代码，指示与目标地址相关联的收件人是否对应于正在查询的林。 如果状态代码指示收件人对应于特定的林，则在查询网络中的其他林之前，可以存储和使用信息来先采样该特定森林。