MULTITHREADED MULTICORE UNIPROCESSOR AND A HETEROGENEOUS MULTIPROCESSOR INCORPORATING THE SAME
    101.
    发明申请
    MULTITHREADED MULTICORE UNIPROCESSOR AND A HETEROGENEOUS MULTIPROCESSOR INCORPORATING THE SAME 审中-公开
    多功能多路复用器和一个异构多媒体处理器

    公开(公告)号:US20080209437A1

    公开(公告)日:2008-08-28

    申请号:US12118958

    申请日:2008-05-12

    申请人: Philip G. Emma

    发明人: Philip G. Emma

    IPC分类号: G06F9/46

    摘要: A uniprocessor that can run multiple threads (programs) simultaneously is achieved by use of a plurality of low-frequency minicore processors, each minicore for receiving a respective thread from a high-frequency cache and processing the thread. A superscalar processor may be used in conjunction with the uniprocessor to process threads requiring high throughput.

    摘要翻译: 可以通过使用多个低频小型处理器来实现可同时运行多个线程(程序)的单处理器,每个微型处理器用于从高频缓存接收相应的线程并处理线程。 超标量处理器可以与单处理器一起使用以处理需要高吞吐量的线程。

    Data processing system with fast queue store interposed between
store-through caches and a main memory
    106.
    发明授权
    Data processing system with fast queue store interposed between store-through caches and a main memory 失效
    数据处理系统与存储通过速度和主存储器间的快速队列存储

    公开(公告)号:US5155831A

    公开(公告)日:1992-10-13

    申请号:US342493

    申请日:1989-04-24

    摘要: A fast queue mechanism is provided which keeps a queue of changes (i.e. store actions) issued by each processor, which queue is accessible by all processors. When any processor issues a store action to a line of memory in the queue, the old data is overwritten with the new data. If the queue does not currently have a corresponding entry, a new entry is activated. Room for the new entry is made by selecting some existing entry, either the oldest or the least recently used, to be removed. An entry that is to be removed is first used to update the line corresponding to it in main memory. After the changes held in the entry to be removed are applied to the old value of the line (from main memory) and the updated value is put back into main memory, the entry in the queue is removed by marking it "empty". When a processor accesses a line of data not in its cache, a cache miss occurs and it is necessary to fetch the line from main memory. Such fetches are monitored by the queue mechanism to see if it is holding changes to the line being fetched. If so, the changes are applied to the line coming from main memory before the line is sent to the requesting processor. After a new entry is made in the queue mechanism, other store actions to the same entry by any processor may occur and usually a number of store actions will occur to the entry before it is removed to make room for another.