会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • MULTI-PROCESSOR CIRCUIT WITH SHARED MEMORY BANKS
    • 具有共享存储器的多处理器电路
    • WO2007072324A3
    • 2007-10-18
    • PCT/IB2006054807
    • 2006-12-13
    • NXP BVBEKOOIJ MARCO J G
    • BEKOOIJ MARCO J G
    • G06F13/16G06F13/18
    • G06F13/1652G06F12/0284
    • A plurality of processors (10) in a multiprocessor circuit is coupled to a plurality of independently addressable memory banks (12) via a connection circuit (14). The connection circuit is arranged to forward addresses from a combination of the processors (10) to addressing inputs of memory banks (12) selected by the addresses. The connection circuit (14) provides for a conflict resolution scheme wherein at least one of the processors (10) is associated with an associated one of the memory banks (12) as an associated processor. The connection circuit (14) guarantees the associated processor a higher minimum guaranteed access frequency to said associated one of the memory banks (12) than to a further one of the memory banks (12) other than the associated one of the memory banks (12). A defragmenter (16) detects data associated with a task running on the associated processor (10) that is stored on the further one of the memory banks (12) and move said data to the associated one of the memory banks (12) during execution of the task. The defragmenter cause addressing of the data by the associated processor (10) to be remapped from said further one of the memory banks (12) to the associated one of the banks after said moving, preferably incrementally as movement of data progresses.
    • 多处理器电路中的多个处理器(10)经由连接电路(14)耦合到多个可独立寻址的存储体(12)。 连接电路被布置成将地址从处理器(10)的组合转发到由地址选择的存储体(12)的寻址输入。 连接电路(14)提供冲突解决方案,其中处理器(10)中的至少一个与相关联的一个存储体(12)相关联,作为相关处理器。 连接电路(14)确保相关联的处理器对存储体(12)中的所述相关联的存储器组(12)之外的存储器(12)中的另一个存储器组(12)之外的相关联的存储器组(12)之间的更高的最小保证访问频率 )。 碎片整理器(16)检测与存储在存储体(12)中的另一个上的相关处理器(10)上运行的任务相关联的数据,并且在执行期间将所述数据移动到相关联的一个存储体(12) 的任务。 碎片整理程序使相关联的处理器(10)对数据进行寻址,以在所述移动之后从所述存储体(12)中的另一个重新映射到相应的一个存储体,优选地随着数据的移动而递增地进行。
    • 4. 发明申请
    • SIGNAL PROCESSING APPARATUS
    • 信号处理装置
    • WO2005116830A1
    • 2005-12-08
    • PCT/IB2005/051648
    • 2005-05-20
    • KONINKLIJKE PHILIPS ELECTRONICS N.V.BEKOOIJ, Marco, J., G.
    • BEKOOIJ, Marco, J., G.
    • G06F9/46
    • G06F9/4887
    • Signal stream processing jobs contain tasks (100), each task (100) to be performed by repeated execution of an operation that processes a chunk of data from a stream. Each job comprises a plurality of the tasks (100) in stream communication with one another. A plurality of processing units (10), which are mutually coupled for the communication of signal streams execute that tasks. A preliminary computation is performed for each job individually, to determine execution parameters required for the job to support a required minimum stream throughput rate if each task of the job is executed in a respective context wherein opportunities to start execution of the task occur separated at most by a cycle time T defined for the task. At run time combination of jobs is selected for execution. Groups of the tasks of the selected combination of jobs are assigned to respective ones of the processing units (10), checking that for each particular processing unit (10) a sum of worst case execution times for the tasks assigned to that particular processing unit (10) does not exceed the defined cycle time T defined for any of the tasks (100) assigned to the particular processing unit (10). The processing unit (10) execute the selected combination of jobs concurrently, each processing unit (10) time multiplexing execution of the group of tasks (100) assigned to that processing unit (10).
    • 信号流处理作业包含任务(100),每个任务(100)将通过重复执行从流处理数据块的操作来执行。 每个作业包括彼此流连接的多个任务(100)。 相互耦合用于信号流的通信的多个处理单元(10)执行该任务。 为每个作业单独执行初步计算,以确定作业所需的执行参数,以支持所需的最小流吞吐率,如果作业的每个任务在相应的上下文中执行,其中开始执行任务的机会最多分开 通过为任务定义的循环时间T。 在运行时,选择作业组合执行。 将所选择的作业组合的任务组分配给处理单元(10)中的相应处理单元(10),检查对于每个特定处理单元(10),分配给该特定处理单元的任务的最坏情况执行时间的总和( 10)不超过为分配给特定处理单元(10)的任何任务(100)定义的定义的周期时间T. 处理单元(10)同时执行选择的作业组合,每个处理单元(10)对分配给该处理单元(10)的任务组(100)进行时间复用执行。
    • 5. 发明申请
    • TYPE CONVERSION UNIT IN A MULTIPROCESSOR SYSTEM
    • 多处理器系统中的类型转换单元
    • WO2004084064A2
    • 2004-09-30
    • PCT/IB2004050268
    • 2004-03-17
    • KONINKL PHILIPS ELECTRONICS NVBEKOOIJ MARCO J G
    • BEKOOIJ MARCO J G
    • G06F9/30G06F9/38
    • G06F9/30025G06F9/3824
    • The invention relates to a very large instruction word (VLIW) processor, comprising a plurality of execution units (101, 103,105), a register file (109, 111, 113) and a communication network (117) for coupling the execution units and the register file. In case of an application specific VLIW processor, i.e. a VLIW processor designed for handling a specific range of applications, the communication network of the VLIW processor may not support all types of data conversions. Therefore, it may turn out that a certain data type conversion is not possible for some applications to be run on such a VLIW processor. By incorporation a type conversion unit (107) in the architecture of the VLIW processor, it can be guaranteed that any desired data type conversion can be performed. In case of a partially connected communication network (117), a communication device (129) can be incorporated as well in the architecture, allowing every execution unit to transfer a value to the type conversion unit, and allowing the type conversion unit to transfer a value to any segment of the distributed register file.
    • 本发明涉及一种非常大的指令字(VLIW)处理器,它包括多个执行单元(101,103,105),一个寄存器文件(109,111,113)和一个通信网络(117),用于将执行单元和 注册文件。 在应用专用VLIW处理器(即设计用于处理特定应用范围的VLIW处理器)的情况下,VLIW处理器的通信网络可能不支持所有类型的数据转换。 因此,可能会导致某些应用程序在这种VLIW处理器上运行某种数据类型转换是不可能的。 通过在VLIW处理器的架构中并入类型转换单元(107),可以保证可以执行任何期望的数据类型转换。 在部分连接的通信网络(117)的情况下,也可以在架构中并入通信设备(129),允许每个执行单元将值传送到类型转换单元,并且允许类型转换单元传送 分配寄存器文件的任何段的值。
    • 6. 发明申请
    • MULTIPROCESSING SYSTEM AND METHOD
    • 多处理系统和方法
    • WO2008117246A1
    • 2008-10-02
    • PCT/IB2008/051121
    • 2008-03-26
    • NXP B.V.BEKOOIJ, Marco, J., G.VAN DEN BRAND, Jan, W.
    • BEKOOIJ, Marco, J., G.VAN DEN BRAND, Jan, W.
    • G06F9/46G06F9/48
    • G06F9/52
    • A multiprocessing system executes a plurality of processes concurrently. A process execution circuit (10) issues requests to access a shared resource (16) from the processes. A shared access circuit (14) sequences conflicting ones of the requests. A simulating access circuit (12) generates signals to stall at least one of the processes at simulated stall time points selected as a predetermined function of requests from only the at least one of the processes and/or the timing of the requests from only the at least one of the processes, irrespective of whether said stalling is made necessary by sequencing of conflicting ones of the requests. Thus, part from predetermined maximum response times, predetermined average timing can be guaranteed, independent of the combination of processes that is executed.
    • 多处理系统同时执行多个处理。 处理执行电路(10)从进程发出访问共享资源(16)的请求。 共享访问电路(14)对序列中的一个请求进行排序。 模拟接入电路(12)产生信号,以使仅在来自所述至少一个的处理和/或来自所述请求的至少一个进程和/或定时的选择作为请求的预定函数选择的模拟停止时间点处的至少一个进程停止 至少一个进程,无论是否通过对冲突请求进行排序而使得停止是必要的。 因此,可以保证预定的最大响应时间的一部分,与执行的处理的组合无关。
    • 7. 发明申请
    • DATA PROCESSING SYSTEM AND METHOD FOR MEMORY DEFRAGMENTATION
    • 数据处理系统和存储器扩展方法
    • WO2006079986A2
    • 2006-08-03
    • PCT/IB2006050279
    • 2006-01-26
    • KONINKL PHILIPS ELECTRONICS NVBEKOOIJ MARCO J G
    • BEKOOIJ MARCO J G
    • G06F12/023
    • A data processing system is provided in a stream-based communication environment. The data processing system comprises at least one processing unit (PUl, PU2) for a stream-based processing of a plurality of processing jobs (J1-J5), a memory means (MEM) having an address range; and a plurality of FIFOs memory mapped to part of the address range of the memory means (MEM), respectively. Each of the FIFOs is associated to one of said plurality of processing jobs (jl-j5) to enable their communication. An address translation unit (ATU) is provided for identifying address ranges in the memory means (MEM) which are not currently used by the plurality of FIFOs and for moving the address range of at least one FIFO to a currently unused address range in the memory means (MEM).
    • 在基于流的通信环境中提供数据处理系统。 数据处理系统包括用于多个处理作业(J1-J5)的基于流的处理的至少一个处理单元(PU1,PU2),具有地址范围的存储装置(MEM) 以及分别映射到存储装置(MEM)的地址范围的一部分的多个FIFO存储器。 每个FIFO与所述多个处理作业(jl-j5)中的一个相关联,以使其能够进行通信。 提供地址转换单元(ATU),用于识别当前未被多个FIFO使用的存储器装置(MEM)中的地址范围,并且用于将至少一个FIFO的地址范围移动到存储器中的当前未使用的地址范围 意思(MEM)。
    • 8. 发明申请
    • A LOOP CONTROL CIRCUIT FOR A DATA PROCESSOR
    • 用于数据处理器的环路控制电路
    • WO2004049154A3
    • 2005-01-20
    • PCT/IB0304962
    • 2003-10-31
    • KONINKL PHILIPS ELECTRONICS NVMEUWISSEN PATRICK P EENGIN NURVAN BERKEL CORNELIS HBEKOOIJ MARCO J G
    • MEUWISSEN PATRICK P EENGIN NURVAN BERKEL CORNELIS HBEKOOIJ MARCO J G
    • G06F9/318G06F9/32G06F9/38
    • G06F9/30181G06F9/325
    • A data processor (200) includes an operation execution unit (225) for executing instructions from an instruction memory (210) indicated by a program counter (220). A loop control circuit (230) stores respective associated loop information for a plurality of instruction loops in a register bank (232). The loop information includes at least an indication of an end of the loop and a loop count for indicating a number of times the loop should be executed. The loop control circuit (230) detects that one of the loops needs to be executed and in response to said detection, loads the loop information for the corresponding loop, and controls the program counter to execute the corresponding loop according to the loaded loop information. The loop information is initialized in response to a loop initialization instruction (240), where the initialization instruction is issued prior to and independent of a start of the loop initialized by the loop information.
    • 数据处理器(200)包括用于从由程序计数器(220)指示的指令存储器(210)执行指令的操作执行单元(225)。 环路控制电路(230)将多个指令循环的相关联的环路信息存储在寄存器组(232)中。 循环信息至少包括循环结束的指示和循环计数,用于指示应该执行循环的次数。 环路控制电路(230)检测到需要执行一个环路,并响应于所述检测,加载相应环路的环路信息,并根据加载的环路信息控制程序计数器执行相应的环路。 响应于循环初始化指令(240)初始化循环信息,其中初始化指令是在由循环信息初始化的循环的开始之前发出的。
    • 9. 发明申请
    • VLIW PROCESSOR WITH COPY REGISTER FILE
    • 具有复制寄存器文件的VLIW处理器
    • WO2004046914A3
    • 2004-09-30
    • PCT/IB0304824
    • 2003-10-28
    • KONINKL PHILIPS ELECTRONICS NVSRINIVASAN BALAKRISHNANBEKOOIJ MARCO J G
    • SRINIVASAN BALAKRISHNANBEKOOIJ MARCO J G
    • G06F9/30G06F9/38
    • G06F9/3012G06F9/30032G06F9/30101G06F9/30141G06F9/3828G06F9/3885G06F9/3891
    • A compute program is executed in a VLIW processor, which contains a plurality of functional units and a plurality of register files that are each coupled to a respective subset of the functional units. When a first instruction is executed that results in writing of a result to a register file in a register addressed by a result address from the first instruction, the result is copied to a copy register in a register file. The copy register is selected dependent on the register file to which the result was written, but at least partially independent of the result address, so that results written to different addressed registers in the register file are copied to the same register in the copy file. Subsequently a copy instruction may be executed to copy the result from the copy register file to a second register file, from which the result may be used as operand of another instruction.
    • 在VLIW处理器中执行计算程序,VLIW处理器包含多个功能单元和多个寄存器文件,每个寄存器文件各自耦合到功能单元的相应子集。 当执行导致将结果写入由第一指令的结果地址寻址的寄存器中的寄存器文件的第一指令时,将结果复制到寄存器文件中的复制寄存器。 复制寄存器取决于写入结果的寄存器文件,但至少部分独立于结果地址,因此写入寄存器文件中不同寻址寄存器的结果将复制到复制文件中的同一寄存器。 随后,可以执行复制指令以将结果从复制寄存器文件复制到第二寄存器文件,从该寄存器文件可以将结果用作另一个指令的操作数。
    • 10. 发明申请
    • MULTI-PROCESSING SYSTEM AND A METHOD OF EXECUTING A PLURALITY OF DATA PROCESSING TASKS
    • 多处理系统和执行多个数据处理任务的方法
    • WO2007132424A3
    • 2008-03-27
    • PCT/IB2007051824
    • 2007-05-14
    • NXP BVBEKOOIJ MARCO J G
    • BEKOOIJ MARCO J G
    • G06F9/48G06F9/38
    • G06F9/48
    • A plurality of data processing tasks with processing elements (10) that contend for a resource (18). Execution of each task comprising executing a series of instructions. During execution indications are measured of the speed of progress of executing the instructions for respective ones of the tasks. Requests to access the resource (18) for different ones of the tasks are arbitrated, a priority for judging arbitration being assigned to each task based on the measured indication of the speed of progress of the task. At least over a part of a range of possible speed of progress values increasingly higher priority is assigned in case of increasingly lower indication of the speed of progress.
    • 具有争用资源(18)的处理元件(10)的多个数据处理任务。 执行每项任务包括执行一系列指令。 在执行过程中,测量执行各个任务的指令的进度的速度。 针对不同的任务访问资源(18)的请求被仲裁,基于所测量的任务进度速度的指示,判断仲裁的优先级被分配给每个任务。 至少在可能的进展速度范围的一部分范围内,越来越低的优先级被分配以指示进度的速度越来越低。