GRISK: An Internet Based Search for K-Optimal Lattice Rules
暂无分享,去创建一个
This paper describe the implementation and underlying philosophie of a large scale distributed computation of K-optimal lattice rules. The computation is huge corresponding to the equivalent of 36 years computation on a single workstation. In this paper we describe our implementation, how we have built in fault tolerence and our strategy for administrating a world wide computation on computer we have no account on.
We also provide a brief description of the problem, that of computing K-optimal lattice rules, and give some statistics to describe the extent of the search.
[1] Ami Marowka,et al. The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..
[2] R. Bixby,et al. On the Solution of Traveling Salesman Problems , 1998 .
[4] Arjen K. Lenstra,et al. The Magic Words are Squeamish Ossifrage , 1994, ASIACRYPT.
[5] J. N. Lyness. An Introduction to Lattice Rules and their Generator Matrices , 1989 .