Sciweavers

2 search results - page 1 / 1
» Time-minimal tiling when rise is larger than zero
Sort
View
PC
2002
82views Management» more  PC 2002»
13 years 4 months ago
Time-minimal tiling when rise is larger than zero
This paper presents a solution to the open problem of finding the optimal tile size to minimise the execution time of a parallelogram-shaped iteration space on a distributed memory...
Jingling Xue, Wentong Cai
SIGMETRICS
2003
ACM
13 years 10 months ago
Maximum and asymptotic UDP throughput under CHOKe
A recently proposed active queue management, CHOKe, aims to protect TCP from UDP flows. Simulations have shown that as UDP rate increases, its bandwidth share initially rises but...
Jiantao Wang, Ao Tang, Steven H. Low