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

1. 发明专利

GB2284081B Computing system 未知
公开(公告)号：GB2284081B
公开(公告)日：1995-10-04
申请号：GB9425745
申请日：1992-08-19
申请人： SEQUENT COMPUTER SYSTEMS INC
发明人： VALENCIA ANDREW J
IPC分类号： G06F9/50 , G06F12/08 , G06F12/0842 , G06F9/46

2. 发明专利

GB2284081A Cache affinity scheduler 未知
公开(公告)号：GB2284081A
公开(公告)日：1995-05-24
申请号：GB9425745
申请日：1992-08-19
申请人： SEQUENT COMPUTER SYSTEMS INC
发明人： VALENCIA ANDREW J
IPC分类号： G06F9/50 , G06F12/08 , G06F12/0842 , G06F9/46
摘要： A computing system 50 includes N symmetrical computing engines having N cache memories joined by a system bus 12. The computing system includes a global run queue (54), an FPA global run queue, and N affinity run queues (58). Each engine is associated with one affinity run queue, which includes multiple slots. When a process first becomes runnable, it is typically attached to one of the global run queues. A scheduler allocates engines to processes and schedules the processes to run on the basis of priority and engine availability. The system keeps track of the number of processes queued to each processor and can transfer a process from one processor to another with a shorter queue.

3. 发明专利

GB2258933A CACHE AFFINITY SCHEDULER 未知
公开(公告)号：GB2258933A
公开(公告)日：1993-02-24
申请号：GB9217740
申请日：1992-08-19
申请人： SEQUENT COMPUTER SYSTEMS INC
发明人： VALENCIA ANDREW J
IPC分类号： G06F9/50 , G06F12/08
摘要： A computing system 50 includes N computing engines having N cache memories connected by a system bus 12. The computing system includes a global run queue (fig 5 not shown), an FPA global run queue, and N affinity run queues, each associated with one computing engine. When a process first becomes runnable, it is typically attached to one of the global run queues. A scheduler allocates engines to processes and schedules the processes to run on the basis of priority and engine availability. Each time a process becomes runnable, the scheduler estimates the remaining cache context for the process in the cache of the engine. The process is enqueued to the affinity run queue of the engine when the estimated cache context of the process is sufficiently high, and is enqueued onto the global run queue when the cache context is sufficiently low. The procedure, therefore, increases computing system performance and reduces bus traffic because processes will run on engines having sufficient cache affinity e.g. engines on which the process was previously running, or will run on the best available engine when there is insufficient cache context.

4. 发明专利

DE4227345C2 未知
公开(公告)号：DE4227345C2
公开(公告)日：1999-01-14
申请号：DE4227345
申请日：1992-08-18
申请人： SEQUENT COMPUTER SYSTEMS INC
发明人： VALENCIA ANDREW J
IPC分类号： G06F9/50 , G06F12/08 , G06F15/76 , G06F9/38 , G06F9/46
摘要： A computing system (50) includes N number of symmetrical computing engines having N number of cache memories joined by a system bus (12). The computing system includes a global run queue (54), an FPA global run queue, and N number of affinity run queues (58). Each engine is associated with one affinity run queue, which includes multiple slots. When a process first becomes runnable, it is typically attached one of the global run queues. A scheduler allocates engines to processes and schedules the processes to run on the basis of priority and engine availability. An engine typically stops running a process before it is complete. When the process becomes runnable again the scheduler estimates the remaining cache context for the process in the cache of the engine. The scheduler uses the estimated amount of cache context in deciding in which run queue a process is to be enqueued. The process is enqueued to the affinity run queue of the engine when the estimated cache context of the process is sufficiently high, and is enqueued onto the global run queue when the cache context is sufficiently low. The procedure increases computing system performance and reduces bus traffic because processes will run on engines having sufficient cache affinity, but will also run on the best available engine when there is insufficient cache context.

5. 发明专利

GB2258933B Cache affinity scheduler 未知
公开(公告)号：GB2258933B
公开(公告)日：1995-10-04
申请号：GB9217740
申请日：1992-08-19
申请人： SEQUENT COMPUTER SYSTEMS INC
发明人： VALENCIA ANDREW J
IPC分类号： G06F9/50 , G06F12/08 , G06F9/46
摘要： A computing system (50) includes N number of symmetrical computing engines having N number of cache memories joined by a system bus (12). The computing system includes a global run queue (54), an FPA global run queue, and N number of affinity run queues (58). Each engine is associated with one affinity run queue, which includes multiple slots. When a process first becomes runnable, it is typically attached one of the global run queues. A scheduler allocates engines to processes and schedules the processes to run on the basis of priority and engine availability. An engine typically stops running a process before it is complete. When the process becomes runnable again the scheduler estimates the remaining cache context for the process in the cache of the engine. The scheduler uses the estimated amount of cache context in deciding in which run queue a process is to be enqueued. The process is enqueued to the affinity run queue of the engine when the estimated cache context of the process is sufficiently high, and is enqueued onto the global run queue when the cache context is sufficiently low. The procedure increases computing system performance and reduces bus traffic because processes will run on engines having sufficient cache affinity, but will also run on the best available engine when there is insufficient cache context.

6. 发明专利

DE4227345A1 未知
公开(公告)号：DE4227345A1
公开(公告)日：1993-02-25
申请号：DE4227345
申请日：1992-08-18
申请人： SEQUENT COMPUTER SYSTEMS INC
发明人： VALENCIA ANDREW J
IPC分类号： G06F9/50 , G06F12/08
摘要： A computing system (50) includes N number of symmetrical computing engines having N number of cache memories joined by a system bus (12). The computing system includes a global run queue (54), an FPA global run queue, and N number of affinity run queues (58). Each engine is associated with one affinity run queue, which includes multiple slots. When a process first becomes runnable, it is typically attached one of the global run queues. A scheduler allocates engines to processes and schedules the processes to run on the basis of priority and engine availability. An engine typically stops running a process before it is complete. When the process becomes runnable again the scheduler estimates the remaining cache context for the process in the cache of the engine. The scheduler uses the estimated amount of cache context in deciding in which run queue a process is to be enqueued. The process is enqueued to the affinity run queue of the engine when the estimated cache context of the process is sufficiently high, and is enqueued onto the global run queue when the cache context is sufficiently low. The procedure increases computing system performance and reduces bus traffic because processes will run on engines having sufficient cache affinity, but will also run on the best available engine when there is insufficient cache context.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式