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

1. 发明授权

US09710943B2 2D region rendering 有权
公开(公告)号：US09710943B2
公开(公告)日：2017-07-18
申请号：US13559427
申请日：2012-07-26
申请人： Edward James Iskenderian , Paul William Morrison
发明人： Edward James Iskenderian , Paul William Morrison
IPC分类号： G06T11/20 , G09G5/00 , G06T15/50 , G06T15/00 , G06T11/40
CPC分类号： G06T11/40
摘要： Disclosed is a method of rendering a plurality of graphical objects. The method generates a region graph using at least a plurality of intersection points of the graphical objects. The intersection points identify disjoint regions each representing a particular combination of the graphical objects, in which the region graph has at least one region graph link, and defines a relationship between the regions. A contributing level and an activating direction are assigned to at least one of the region graph links, the level and the activation direction defining an appearance of the region associated with said region graph link. The method then renders the plurality of graphical objects using the assigned contributing level and activating direction of the region graph links by traversing the region graph to determine at least one contributing level for each region in the region graph using the assigned contributing level and the activating direction.

2. 发明授权

US08531725B2 Rastering disjoint regions of the page in parallel 有权
标题翻译：并行翻译页面的不相交区域
公开(公告)号：US08531725B2
公开(公告)日：2013-09-10
申请号：US13153209
申请日：2011-06-03
申请人： Paul William Morrison , David Robert James Monaghan , Edward James Iskenderian
发明人： Paul William Morrison , David Robert James Monaghan , Edward James Iskenderian
IPC分类号： G06K15/02
CPC分类号： G06K15/181 , G06K15/1848 , G06T11/40
摘要： Disclosed is a method of rasterizing a page comprising a plurality of graphic objects. The method obtains a plurality of pixel-aligned object edges (302,303) of the graphic objects (203), and determining a pixel generation path (402) for the plurality of graphic objects. The method determines a plurality of crossing locations (420-424) based on the pixel aligned object edges and the pixel generation path, at least one of the crossing locations being a vertical crossing location and at least one other crossing location being a horizontal crossing location, rasterizes the page according to the pixel generation path by updating a fill sequence (620-623) upon encountering said determined crossing locations.
摘要翻译：公开了一种光栅化包括多个图形对象的页面的方法。该方法获得图形对象（203）的多个像素对齐对象边缘（302,303），并确定多个图形对象的像素生成路径（402）。该方法基于像素对准边缘和像素生成路径来确定多个交叉位置（420-424），交叉位置中的至少一个是垂直交叉位置，并且至少一个其他交叉位置是水平交叉位置通过在遇到所述确定的交叉位置时更新填充序列（620-623），根据像素生成路径来光栅化页面。

3. 发明申请

US20110299105A1 RASTERING DISJOINT REGIONS OF THE PAGE IN PARALLEL 有权
标题翻译：平行排列区域
公开(公告)号：US20110299105A1
公开(公告)日：2011-12-08
申请号：US13153209
申请日：2011-06-03
申请人： Paul William Morrison , David Robert James Monaghan , Edward James Iskenderian
发明人： Paul William Morrison , David Robert James Monaghan , Edward James Iskenderian
IPC分类号： G06K15/02
CPC分类号： G06K15/181 , G06K15/1848 , G06T11/40
摘要： Disclosed is a method of rasterizing a page comprising a plurality of graphic objects. The method obtains a plurality of pixel-aligned object edges (302,303) of the graphic objects (203), and determining a pixel generation path (402) for the plurality of graphic objects. The method determines a plurality of crossing locations (420-424) based on the pixel aligned object edges and the pixel generation path, at least one of the crossing locations being a vertical crossing location and at least one other crossing location being a horizontal crossing location, rasterizes the page according to the pixel generation path by updating a fill sequence (620-623) upon encountering said determined crossing locations.
摘要翻译：公开了一种光栅化包括多个图形对象的页面的方法。该方法获得图形对象（203）的多个像素对齐对象边缘（302,303），并确定多个图形对象的像素生成路径（402）。该方法基于像素对准边缘和像素生成路径来确定多个交叉位置（420-424），交叉位置中的至少一个是垂直交叉位置，并且至少一个其他交叉位置是水平交叉位置通过在遇到所述确定的交叉位置时更新填充序列（620-623），根据像素生成路径来光栅化页面。

4. 发明授权

US08964216B2 Predicting the times of future events in a multi-threaded RIP 有权
标题翻译：预测多线程RIP中未来事件的时间
公开(公告)号：US08964216B2
公开(公告)日：2015-02-24
申请号：US13312863
申请日：2011-12-06
申请人： Paul William Morrison , David Robert James Monaghan , Ekaterina Stefanov
发明人： Paul William Morrison , David Robert James Monaghan , Ekaterina Stefanov
IPC分类号： G06F3/12 , G06K15/02
CPC分类号： G06K15/1857 , G06F3/1211 , G06F3/124 , G06F3/1285 , G06K15/1861
摘要： Disclosed is a method (2500) of determining, for a rendering job (2402) comprising one or more page building jobs, a start time for a print engine (195) to print the rendering job (2402), the method including determining (2502) for the rendering job a current start time for printing based on at least a predicted finishing time of a page building job, determining (2503) a difference between the predicted finishing time and an actual finishing time of the page building job, determining (2504) if, based on the difference, a predetermined condition is satisfied, and if the predetermined criterion is satisfied, determining (2505) an updated start time for printing the rendering job based on information relating to the actual finishing time of the page building job, and starting (2509) the print engine to print the rendering job at the updated start time.
摘要翻译：公开了一种方法（2500），对于包括一个或多个页面构建作业的呈现作业（2402），确定打印引擎（195）打印渲染作业（2402）的开始时间，所述方法包括确定（2502 ），用于基于至少预定的页面建立作业的完成时间来打印当前的打印开始时间，确定（2503）预测的完成时间与页面构建作业的实际完成时间之间的差异，确定（2504））如果基于差异，则满足预定条件，并且如果满足预定标准，则基于与页面构建作业的实际完成时间有关的信息，确定（2505）更新的打印渲染作业的开始时间，并启动（2509）打印引擎以在更新的开始时间打印渲染作业。

5. 发明申请

US20120147387A1 PREDICTING THE TIMES OF FUTURE EVENTS IN A MULTI-THREADED RIP 有权
标题翻译：预测多路由RIP中的未来事件的时间
公开(公告)号：US20120147387A1
公开(公告)日：2012-06-14
申请号：US13312863
申请日：2011-12-06
申请人： Paul William Morrison , David Robert James Monaghan , Ekaterina Stefanov
发明人： Paul William Morrison , David Robert James Monaghan , Ekaterina Stefanov
IPC分类号： G06F3/12
CPC分类号： G06K15/1857 , G06F3/1211 , G06F3/124 , G06F3/1285 , G06K15/1861
摘要： Disclosed is a method (2500) of determining, for a rendering job (2402) comprising one or more page building jobs, a start time for a print engine (195) to print the rendering job (2402), the method including determining (2502) for the rendering job a current start time for printing based on at least a predicted finishing time of a page building job, determining (2503) a difference between the predicted finishing time and an actual finishing time of the page building job, determining (2504) if, based on the difference, a predetermined condition is satisfied, and if the predetermined criterion is satisfied, determining (2505) an updated start time for printing the rendering job based on information relating to the actual finishing time of the page building job, and starting (2509) the print engine to print the rendering job at the updated start time.
摘要翻译：公开了一种方法（2500），对于包括一个或多个页面构建作业的呈现作业（2402），确定打印引擎（195）打印渲染作业（2402）的开始时间，所述方法包括确定（2502 ），用于基于至少预测的页面建立作业的完成时间来打印当前的打印开始时间，确定（2503）预测的完成时间与页面构建作业的实际完成时间之间的差异，确定（2504））如果基于差异，则满足预定条件，并且如果满足预定标准，则基于与页面构建作业的实际完成时间有关的信息，确定（2505）更新的打印渲染作业的开始时间，并启动（2509）打印引擎以在更新的开始时间打印渲染作业。

6. 发明授权

US09015722B2 Efficient cache reuse through application determined scheduling 有权
标题翻译：通过应用程序确定的调度高效缓存重用
公开(公告)号：US09015722B2
公开(公告)日：2015-04-21
申请号：US13588528
申请日：2012-08-17
申请人： Ekaterina Stefanov , David Robert James Monaghan , Paul William Morrison
发明人： Ekaterina Stefanov , David Robert James Monaghan , Paul William Morrison
IPC分类号： G06F9/50 , G06F13/00
CPC分类号： G06F9/5033 , G06F2209/5018
摘要： A method of determining a thread from a plurality of threads to execute a task in a multi-processor computer system. The plurality of threads is grouped into at least one subset associated with a cache memory of the computer system. The task has a type determined by a set of instructions. The method obtains an execution history of the subset of plurality of threads and determines a weighting for each of the set of instructions and the set of data, the weightings depending on the type of the task. A suitability of the subset of the threads to execute the task based on the execution history and the determined weightings, is then determined. Subject to the determined suitability of the subset of threads, the method determining a thread from the subset of threads to execute the task using content of the cache memory associated with the subset of threads.
摘要翻译：一种从多个线程确定线程以在多处理器计算机系统中执行任务的方法。多个线程被分组成与计算机系统的高速缓冲存储器相关联的至少一个子集。任务具有由一组指令确定的类型。该方法获得多个线程的子集的执行历史，并且根据任务的类型确定对于该组指令和该组数据中的每一个的权重。然后确定线程的子集适合于基于执行历史和确定的权重来执行任务。根据所确定的线程子集的适合性，该方法确定线程子集中的线程，以使用与线程子集相关联的高速缓冲存储器的内容来执行任务。

7. 发明申请

US20130047162A1 EFFICIENT CACHE REUSE THROUGH APPLICATION DETERMINED SCHEDULING 有权
标题翻译：通过应用程序确定调度的高效缓存
公开(公告)号：US20130047162A1
公开(公告)日：2013-02-21
申请号：US13588528
申请日：2012-08-17
申请人： Ekaterina Stefanov , David Robert James Monaghan , Paul William Morrison
发明人： Ekaterina Stefanov , David Robert James Monaghan , Paul William Morrison
IPC分类号： G06F9/46
CPC分类号： G06F9/5033 , G06F2209/5018
摘要： A method of determining a thread from a plurality of threads to execute a task in a multi-processor computer system. The plurality of threads is grouped into at least one subset associated with a cache memory of the computer system. The task has a type determined by a set of instructions. The method obtains an execution history of the subset of plurality of threads and determines a weighting for each of the set of instructions and the set of data, the weightings depending on the type of the task. A suitability of the subset of the threads to execute the task based on the execution history and the determined weightings, is then determined. Subject to the determined suitability of the subset of threads, the method determining a thread from the subset of threads to execute the task using content of the cache memory associated with the subset of threads.
摘要翻译：从多个线程确定线程以在多处理器计算机系统中执行任务的方法。多个线程被分组成与计算机系统的高速缓冲存储器相关联的至少一个子集。任务具有由一组指令确定的类型。该方法获得多个线程的子集的执行历史，并且根据任务的类型确定对于该组指令和该组数据中的每一个的权重。然后确定线程的子集适合于基于执行历史和确定的权重来执行任务。根据所确定的线程子集的适合性，该方法确定线程子集中的线程，以使用与线程子集相关联的高速缓冲存储器的内容来执行任务。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式