Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6807Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Keckler, Stephen W. | - |
| dc.date | 2004-10-20T19:57:35Z | - |
| dc.date | 2004-10-20T19:57:35Z | - |
| dc.date | 1992-09-01 | - |
| dc.date.accessioned | 2013-10-09T02:46:59Z | - |
| dc.date.available | 2013-10-09T02:46:59Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AITR-1355 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6807 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | This report describes Processor Coupling, a mechanism for controlling multiple ALUs on a single integrated circuit to exploit both instruction-level and inter-thread parallelism. A compiler statically schedules individual threads to discover available intra-thread instruction-level parallelism. The runtime scheduling mechanism interleaves threads, exploiting inter-thread parallelism to maintain high ALU utilization. ALUs are assigned to threads on a cycle byscycle basis, and several threads can be active concurrently. Simulation results show that Processor Coupling performs well both on single threaded and multi-threaded applications. The experiments address the effects of memory latencies, function unit latencies, and communication bandwidth between function units. | - |
| dc.format | 165 p. | - |
| dc.format | 19986107 bytes | - |
| dc.format | 16194697 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AITR-1355 | - |
| dc.subject | runtime scheduling | - |
| dc.subject | compile time scheduling | - |
| dc.subject | parallelscomputers | - |
| dc.subject | multithreading | - |
| dc.title | A Coupled Multi-ALU Processing Node for a Highly Parallel Computer | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
