4747 search results - page 403 / 950 » Shuffle Memory System |
157
click to vote
HICSS
1999
IEEE
15 years 11 months ago
1999
IEEE
The paper introduces an internet-based remote prototyping platform for accelerator applications. It gives an overview on the Xputer prototype Map-oriented Machine with Parallel Da...
187
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
175
click to vote
EUROPAR
1999
Springer
15 years 11 months ago
1999
Springer
For complex queries in parallel database systems, substantial amounts of data must be redistributed between operators executed on different processing nodes. Frequently, such inter...
119
click to vote
ASPDAC
1998
ACM
15 years 11 months ago
1998
ACM
This paper describes the unrolling of loops with indeterminate loop counts in system level pipelines. Two methods are discussed in this paper. The first method is the varied latenc...
172
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
- Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register les must be preserved in order for the task to be resumed. This e...