Scheduling parallel loops for processing linear lists

Imperative languages such as C, FORTRAN 90 or Modula-2 are being increasingly used to program parallel computers. By using these languages, the normal programming environment is disposable, however runtime deteriorates. The problem is the existence of pointers and dynamic data structures, which prevent effective parallelization methods. We demonstrate a new technique for shared memory systems. The list approach with pipeline method works on a linear list in parallel. After a theoretical valuation, the practical operation on a KSR1 system is discussed.