Department of Computer Science
The University of Hong Kong

PARALLEL ARCHITECTURES/AGORITHMS RESEARCH



PEOPLE

BACKGROUND

Forthcoming.

RESEARCH RESULTS AND PROBLEMS

Forthcoming.

TECH REPORTS AND PAPERS

  1. F.C.M. Lau and S.H. Zhang, Fast Gossiping in Meshes/Tori with Bounded-Size Packets, Technical Report TR-97-13, Department of Computer Science, The University of Hong Kong, August 1997. (Zipped postscript)
  2. F.C.M. Lau and G. Chen, An Algorithm for Optimal Routing in Shuffle-Exchange Networks, Technical Report TR-97-12, Department of Computer Science, The University of Hong Kong, August 1997. (Zipped postscript)
  3. F.C.M. Lau and S.H. Zhang, Optimal Gossiping in Paths and Cycles, Technical Report TR-97-11, Department of Computer Science, The University of Hong Kong, July 1997. (Zipped postscript) (Revised version)
  4. G. Chen and F.C.M. Lau, Layout of the Cube-Connected Cycles without Long Wires, Technical Report TR-97-09, Department of Computer Science, The University of Hong Kong, May 1997. (Zipped postscript)
  5. G. Chen and F.C.M. Lau, Tighter Layouts of the Cube-Connected Cycles, Technical Report TR-97-06, Department of Computer Science, The University of Hong Kong, May 1997. (Zipped postscript)
  6. C.K. Au-Yeung, F.C.M. Lau, and S. Cheung, ``Efficient Computations on Cube-Mesh: A Mesh with Express Links.'' Computer Architecture '97: Selected Papers of the 2nd Australasian Conference, R. Pose (ed.), Springer, 1997, 205-216.
  7. G. Chen and F.C.M. Lau, ``The Wall Mesh.'' Computer Architecture '97: Selected Papers of the 2nd Australasian Conference, R. Pose (ed.), Springer, 1997, 217-230.
  8. G. Chen and F.C.M. Lau, The Wall Mesh, Technical Report TR-97-03, Department of Computer Science, The University of Hong Kong, January 1997. (Zipped postscript)
  9. F.C.M. Lau, On the optimality of the Manhattan Street Network, November 1996, unpublished manuscript, submitted for publication. (Zipped postscript)
  10. F.C.M. Lau, The Meandering Street Network, Technical Report TR-96-10, Department of Computer Science, The University of Hong Kong, November 1996. (Zipped postscript)
  11. F.C.M. Lau and G. Chen, ``Optimal Layouts of Midimew Networks.'' IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 9, September 1996, 954-961.
  12. G. Chen and F.C.M. Lau, ``Shuffle-Ring: Overcoming the Increasing Degree of Hypercube.'' Proceedings of Second International Symposium on High-Performance Computer Architecture (HPCA-2), San Jose, California, February 1996, 130-138.
  13. S. Cheung and F.C.M. Lau, ``Routing with Locality on Meshes with Buses.'' Journal of Parallel and Distributed Computing, Vol. 33, No. 1, February 1996, 84-90.
  14. S. Cheung and F.C.M. Lau ``Routing with Locality in Partitioned-Bus Meshes.'' Proceedings of 6th IEEE Symposium on Parallel and Distributed Processing, Dallas, Texas, October 1994, 715-721.
  15. G. Chen and F.C.M. Lau, ``Laying Out Midimew Networks with Constant Dilation.'' Proceedings of CONPAR 94 - VAPP VI Joint International Conference, Linz, Austria, September 1994, 773-784.