Learn More
In this paper we investigate a semi on-line multiprocessor scheduling problem. The problem is the classical on-line multiprocessor problem where the total sum of the tasks is known in advance. We show an asymptotic lower bound on the performance ratio of any algorithm (as the number of processors gets large), and present an algorithm which has performance(More)
Definition of the partition function of U(1) gauge theory is extended to a class of four-manifolds containing all compact spaces and the asymptotically locally flat (ALF) ones including the multi-Taub–NUT sopaces. The partition function is calculated via zeta-function regularization and heat kernel techniques with special attention to its modular(More)
  • 1