Recent advancements in hardware technology have increased the power of the conventional computer. However, a conventional computer can only perform one task at a given moment. Parallel computers consist of many processors working together simultaneously, which should make them faster and more powerful than the conventional computer. In this work, we study the performance of linearly connected parallel machines by examining several job scheduling algorithms for these computers. Our motivation for this study is the observation that the computation power of personal computers is poorly utilized, and if personal computers are connected in parallel, they may be used instead of expensive mainframe computers. Furthermore, we study the common problem of sorting large files using parallel computers and compare the performance with hat of sequential computers. These simulations demonstrate that Linearly connected personal computers can provide good computing power and speedup if the local computing load on these personal computers is not too high.