Implementing the Combination of Time Sharing and Space Sharing on AP/Linux

| We report the implementation of a scheduling method which combines time sharing and space sharing on AP/Linux. To run many tasks simultaneously on a parallel computer, the parallel computer system needs a partitioning algorithm that can partition processors for incoming tasks. However, a typical problem for the algorithm is a blockade situation, which causes low processor utilization and slow response. To avoid such a situation, we present a Time Sharing System (TSS) scheme that uses a partitioning algorithm. In this paper we state the implementation design of our TSS on a real parallel computer, the Fujitsu AP1000+. The design is based on the parallel operating system, AP/Linux. We report our current implementation and the performance. Keywords: time sharing, space sharing, partitioning algorithm, AP/Linux I. Introduction Parallel computers are becoming more popular for many applications and many commercial parallel computers are on the market. Since every application cannot util..