专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

31. 发明申请

US20080147698A1 DATA SCHEMATA IN PROGRAMMING LANGUAGE CONTRACTS 有权
标题翻译：编程语言合同中的数据方案
公开(公告)号：US20080147698A1
公开(公告)日：2008-06-19
申请号：US11613046
申请日：2006-12-19
申请人： Niklas Gustafsson , John L. Hamby , Patrick J. Helland
发明人： Niklas Gustafsson , John L. Hamby , Patrick J. Helland
IPC分类号： G06F17/30
CPC分类号： G06F17/30569
摘要： Systems and methods that integrate data type conversion(s) into a programming language, and describe external formats within a syntax thereof. A mapping component defines a declarative mapping from an external data format to one or more of its internal data types (e.g., expressing external data types in terms of source languages.) Moreover, a rule establishing component can define value-based rules, such as invariants to the external data format, wherein the schema declaration further defines data fields that make up the schema. Accordingly, by expressing rules in form of predicate logic (instead of imperative program logic) the subject innovation increase a likelihood that compilers can reason about the data.
摘要翻译：将数据类型转换集成到编程语言中的系统和方法，并在其语法内描述外部格式。映射组件定义了从外部数据格式到其一个或多个内部数据类型（例如，根据源语言表达外部数据类型）的声明性映射。此外，规则建立组件可以定义基于价值的规则，例如外部数据格式的不变量，其中模式声明进一步定义构成模式的数据字段。因此，通过以谓词逻辑（而不是命令式程序逻辑）的形式表达规则，主题创新增加了编译器可以对数据进行推理的可能性。

32. 发明申请

US20060020446A1 Implementation of concurrent programs in object-oriented languages 有权
标题翻译：以面向对象语言实现并发程序
公开(公告)号：US20060020446A1
公开(公告)日：2006-01-26
申请号：US10887739
申请日：2004-07-09
申请人： John Hamby , Niklas Gustafsson , Jason Allen
发明人： John Hamby , Niklas Gustafsson , Jason Allen
IPC分类号： G06F17/27
CPC分类号： G06F9/54 , G06F8/31 , G06F9/52
摘要： The present invention adds support for concurrency to a mainstream object-oriented language. Language extensions are provided that can enable programs to be developed that can either be run in one address space, distributed across several process on a single computer, or distributed across a local-area or wide-area network, without recoding the program. Central to this aspect is the notion of a service, which can execute its own algorithmic (logical) thread. Services do not share memory or synchronize using explicit synchronization primitives. Rather, both data sharing and synchronization is accomplished via message-passing, e.g., a set of explicitly declared messages are sent between services. Messages can contain data that is shared, and the pattern of message exchange provide the necessary synchronization.
摘要翻译：本发明增加了对主流面向对象语言的并发性的支持。提供了语言扩展，可以使开发程序能够在一个地址空间中运行，分布在单个计算机上的多个进程中，或分布在局域网或广域网上，而无需重新编程程序。这个方面的核心是服务的概念，它可以执行自己的算法（逻辑）线程。服务不共享内存或使用显式同步原语进行同步。相反，数据共享和同步通过消息传递来实现，例如，在服务之间发送一组明确声明的消息。消息可以包含共享的数据，并且消息交换的模式提供必要的同步。

33. 发明申请

US20050148337A1 Method and arrangement for network load regulation 审中-公开
标题翻译：网络负载调节的方法和布置
公开(公告)号：US20050148337A1
公开(公告)日：2005-07-07
申请号：US10496737
申请日：2001-11-30
申请人： Bernt Karlsson , Niklas Gustafsson
发明人： Bernt Karlsson , Niklas Gustafsson
IPC分类号： H04M3/36 , H04Q3/00 , H04Q7/20
CPC分类号： H04M3/36 , H04M3/367 , H04Q3/0062
摘要： The present invention relates to a method in communication networks comprising an automatic load regulation method for the network nodes. A load regulation of a controlled node to a desired load is achieved by means of a comparison of the number of call setup attempts per second during a regulation period for a given load and the allowable number of calls for a desired load. Preventive or regular call restriction measures and measures that release said restrictions are initiated depending on the deviation of the number of calls for the desired load from said number of call setup attempts for the given load. Call regulations for terminating calls are distributed to adjacent nodes by means of call gap arguments that specify minimum time intervals between consecutive call attempts from an adjacent node. Call regulations for originating calls are distributed amongst the various MS-groups and Location Areas of the controlled node.
摘要翻译：本发明涉及一种通信网络中的一种方法，其包括用于网络节点的自动负载调节方法。受控节点对所需负载的负载调节是通过比较给定负载的调节周期内每秒的呼叫建立尝试次数和对所需负载的允许呼叫次数来实现的。根据给定负载的所述呼叫建立尝试次数的所需负载的呼叫次数的偏差，启动释放所述限制的预防或定期呼叫限制措施和措施。用于终止呼叫的呼叫规则通过呼叫间隙参数分配到相邻节点，所述呼叫间隙参数指定了来自相邻节点的连续呼叫尝试之间的最小时间间隔。来电呼叫规则分布在受控节点的各种MS组和位置区域之间。

34. 发明授权

US09547511B2 Language-based model for asynchronous operations 有权
标题翻译：基于语言的异步操作模型
公开(公告)号：US09547511B2
公开(公告)日：2017-01-17
申请号：US12479186
申请日：2009-06-05
申请人： Niklas Gustafsson , Geoffrey M. Kizer
发明人： Niklas Gustafsson , Geoffrey M. Kizer
IPC分类号： G06F9/44 , G06F9/45 , G06F9/455
CPC分类号： G06F9/45516 , G06F8/40 , G06F8/41 , G06F8/45 , G06F8/458
摘要： A language-based model to support asynchronous operations set forth in a synchronous syntax is provided. The asynchronous operations are transformed in a compiler into an asynchronous pattern, such as an APM-based pattern (or asynchronous programming model based pattern). The ability to compose asynchronous operations comes from the ability to efficiently call asynchronous methods from other asynchronous methods, pause them and later resume them, and effectively implementing a single-linked stack. One example includes support for ordered and unordered compositions of asynchronous operations. In an ordered composition, each asynchronous operation is started and finished before another operation in the composition is started. In an unordered composition, each asynchronous operation is started and completed independently of the operations in the unordered composition.
摘要翻译：提供了一种基于语言的模型，用于支持同步语法中提出的异步操作。异步操作在编译器中转换为异步模式，例如基于APM的模式（或基于异步编程模型的模式）。组合异步操作的能力来自于能够从其他异步方法有效地调用异步方法，暂停它们并稍后恢复它们，并有效地实现单链接堆栈。一个例子包括支持异步操作的有序和无序组合。在有序组合中，在组合中的另一个操作开始之前，每个异步操作都被启动并完成。在无序组合中，每个异步操作独立于无序组合中的操作而启动和完成。

35. 发明授权

US08856792B2 Cancelable and faultable dataflow nodes 有权
标题翻译：可取消和可错误的数据流节点
公开(公告)号：US08856792B2
公开(公告)日：2014-10-07
申请号：US12972039
申请日：2010-12-17
申请人： Zlatko V. Michailov , Niklas Gustafsson , Daniela Cristina Manu , Stephen H. Toub
发明人： Zlatko V. Michailov , Niklas Gustafsson , Daniela Cristina Manu , Stephen H. Toub
IPC分类号： G06F9/46 , G06F9/44 , G06F9/54
CPC分类号： G06F9/542 , G06F9/466 , G06F9/546
摘要： One embodiment includes a method of performing dataflow processing. The method includes representing a first asynchronous processing node as a first future. The first future represents the lifecycle of processing of the first asynchronous processing node. The method further includes representing one or more other asynchronous operations as one or more other futures. The one or more other futures represent the asynchronous completion of one or more operations'processing. The first future and the one or more other futures are represented as a single composite future. The single composite future represents completion of processing of the combination of the first asynchronous processing node and the one or more other asynchronous operations.
摘要翻译：一个实施例包括执行数据流处理的方法。该方法包括将第一异步处理节点表示为第一未来。第一个未来代表了处理第一个异步处理节点的生命周期。该方法还包括将一个或多个其他异步操作表示为一个或多个其他期货。一个或多个其他期货表示异步完成一个或多个操作的处理。第一个未来和一个或多个其他未来将被视为一个复合的未来。单个复合未来表示第一异步处理节点和一个或多个其他异步操作的组合的处理的完成。

36. 发明授权

US08549506B2 Resumable methods 有权
标题翻译：可读方法
公开(公告)号：US08549506B2
公开(公告)日：2013-10-01
申请号：US12767811
申请日：2010-04-27
申请人： Henricus Johannes Maria Meijer , Mads Torgersen , Neal M. Gafter , Niklas Gustafsson
发明人： Henricus Johannes Maria Meijer , Mads Torgersen , Neal M. Gafter , Niklas Gustafsson
IPC分类号： G06F9/45
CPC分类号： G06F8/314
摘要： APIs are provided, that are external to a programming language but that provide functionality that can be plugged into a language compiler. The provided APIs tailor functionality associated with asynchronous programming, iterators or writing symmetric co-routines using a generalized pattern-based approach. Several types of resumable methods are provided in the APIs which can be applied to method bodies written in traditional program code. Syntactically distinguishable control points in method bodies written in traditional program code invoke transformation of the code by the compiler using the external APIs. The transformed code enables the pausing and resumption of the code sandwiched between control points in the transformed code. The source code contained within a method having control points in it is transformed so that code within the method can be executed in discrete parts, each part starting and ending at a control point in the transformed code.
摘要翻译：提供API，它们是编程语言外部的，但是提供可以插入到语言编译器中的功能。提供的API定制与异步编程相关的功能，迭代器或使用广义的基于模式的方法来编写对称协同程序。 API中提供了几种类型的可恢复方法，可以将其应用于以传统程序代码编写的方法体。以传统程序代码编写的方法体中的语法上可区分的控制点通过外部API调用编译器对代码的转换。转换的代码使得能够暂停和恢复被转换代码中的控制点之间的代码。包含在具有其中的控制点的方法中的源代码被变换，使得该方法中的代码可以以离散部分执行，每个部分开始并在变换代码的控制点结束。

37. 发明申请

US20120159512A1 CANCELABLE AND FAULTABLE DATAFLOW NODES 有权
标题翻译：无效和故障的数据流
公开(公告)号：US20120159512A1
公开(公告)日：2012-06-21
申请号：US12972039
申请日：2010-12-17
申请人： Zlatko V. Michailov , Niklas Gustafsson , Daniela Cristina Manu , Stephen H. Toub
发明人： Zlatko V. Michailov , Niklas Gustafsson , Daniela Cristina Manu , Stephen H. Toub
IPC分类号： G06F9/46
CPC分类号： G06F9/542 , G06F9/466 , G06F9/546
摘要： One embodiment includes a method of performing dataflow processing. The method includes representing a first asynchronous processing node as a first future. The first future represents the lifecycle of processing of the first asynchronous processing node. The method further includes representing one or more other asynchronous operations as one or more other futures. The one or more other futures represent the asynchronous completion of one or more operations' processing. The first future and the one or more other futures are represented as a single composite future. The single composite future represents completion of processing of the combination of the first asynchronous processing node and the one or more other asynchronous operations.
摘要翻译：一个实施例包括执行数据流处理的方法。该方法包括将第一异步处理节点表示为第一未来。第一个未来代表了处理第一个异步处理节点的生命周期。该方法还包括将一个或多个其他异步操作表示为一个或多个其他期货。一个或多个其他期货表示异步完成一个或多个操作的处理。第一个未来和一个或多个其他未来将被视为一个复合的未来。单个复合未来表示第一异步处理节点和一个或多个其他异步操作的组合的处理的完成。

38. 发明申请

US20110161604A1 WRITER/READER/NO-ACCESS DOMAIN DATA ACCESSIBILITY 有权
标题翻译： WRITER / READER /无访问域数据访问
公开(公告)号：US20110161604A1
公开(公告)日：2011-06-30
申请号：US12649255
申请日：2009-12-29
申请人： Artur Laksberg , Joshua D. Phillips , Niklas Gustafsson
发明人： Artur Laksberg , Joshua D. Phillips , Niklas Gustafsson
IPC分类号： G06F12/10
CPC分类号： G06F9/4881 , G06F9/526 , G06F2209/483
摘要： Multiple types of executable agents operating within a domain. The domain includes mutable shared state and immutable shared state, with agents internal to the domain only operating on the shared state. Writer agents are defined to be agents that have read access and write access to mutable shared state and read access only to immutable shared state. General reader agents have read access to both mutable shared state and immutable shared state and have no write access. Immutable reader agents have read access to only immutable shared state and have no write access. By appropriate scheduling of the different types of agents, data races may be reduced or eliminated.
摘要翻译：域内运行的多种类型的可执行代理。域包括可变共享状态和不可变共享状态，域内的代理只能在共享状态下运行。作者代理被定义为具有对可变共享状态的读访问和写访问权限的代理，并且仅对不可变共享状态的读访问。通用读写器代理读取访问可变共享状态和不可变共享状态，并且不具有写入权限。不可变的读取器代理只读访问只有不可变的共享状态，没有写入权限。通过适当调度不同类型的代理，可以减少或消除数据竞争。

39. 发明申请

US20100318995A1 THREAD SAFE CANCELLABLE TASK GROUPS 有权
标题翻译：螺纹安全可拆卸任务组
公开(公告)号：US20100318995A1
公开(公告)日：2010-12-16
申请号：US12481770
申请日：2009-06-10
申请人： William R. Messmer , David Callahan , Paul F. Ringseth , Niklas Gustafsson
发明人： William R. Messmer , David Callahan , Paul F. Ringseth , Niklas Gustafsson
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F9/46 , G06F9/461 , G06F9/4843
摘要： A scheduler in a process of a computer system schedules tasks of a task group for concurrent execution by multiple execution contexts. The scheduler provides a mechanism that allows the task group to be cancelled by an arbitrary execution context or an asynchronous error state. When a task group is cancelled, the scheduler sets a cancel indicator in each execution context that is executing tasks corresponding to the cancelled task group and performs a cancellation process on each of the execution contexts where a cancel indicator is set. The scheduler also creates local aliases to allow task groups to be used without synchronization by execution contexts that are not directly bound to the task groups.
摘要翻译：计算机系统进程中的调度器调度任务组的任务，用于多个执行上下文的并发执行。调度程序提供了允许任务组被任意执行上下文或异步错误状态取消的机制。当任务组被取消时，调度器在执行对应于被取消的任务组的任务的执行上下文中设置取消指示符，并且对设置了取消指示符的每个执行上下文执行取消处理。调度程序还创建本地别名，以允许不直接绑定到任务组的执行上下文同时使用任务组。

40. 发明申请

US20090300638A1 MEMORY ALLOCATORS CORRESPONDING TO PROCESSOR RESOURCES 有权
标题翻译：与处理器资源相关的记忆分配器
公开(公告)号：US20090300638A1
公开(公告)日：2009-12-03
申请号：US12131471
申请日：2008-06-02
申请人： Niklas Gustafsson , Paul Ringseth , Philip Lucido
发明人： Niklas Gustafsson , Paul Ringseth , Philip Lucido
IPC分类号： G06F9/46
CPC分类号： G06F9/5016 , G06F9/5077
摘要： A memory allocator is provided for each processor resource in a process of a computer system. Each memory allocator includes a set of pages, a locally freed list of objects, and a remotely freed list of objects. Each memory allocator requests the pages from an operating system and allocates objects to all execution contexts executing on a corresponding processing resource. Each memory allocator attempts to allocate an object from the locally freed list before allocating an object from the remotely freed list or an allocated page.
摘要翻译：在计算机系统的过程中为每个处理器资源提供存储器分配器。每个内存分配器包括一组页面，一个本地释放的对象列表以及一个远程释放的对象列表。每个内存分配器从操作系统请求页面，并将对象分配给在相应处理资源上执行的所有执行上下文。在从远程释放的列表或分配的页面分配对象之前，每个内存分配器尝试从本地释放的列表中分配一个对象。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式