Floyd B. Hanson

Laboratory for Advanced Computing

Annotated Publications in Parallel Scheduling Environments

39. F. B. Hanson and D. C. Sorensen, SCHEDULE Parallel Programming Package with Recycling Job Queues and Iterated Dependency Graphs , Concurrency: Practice and Experience, vol. 2, pp. 33-54, March 1990.

In this paper, with Sorensen of Rice University, was presented at Supercomputing 1988, Orlando, FL, Nov. 1988. It describes the enhancements of the SCHEDULE parallel programming package. The use of recycling queues enable users to run large applications, with one example executing more than a million dynamic processes ({\it 1 MEGAPROC} case). Also, SCHEDULE was made more efficient for iterations and time-stepping problems by the reuse of data or control dependency graph parameters, instead of re-initializing at each iteration. The PI's improved version of SCHEDULE was designated as the official version of SCHEDULE on the NETLIB public domain network software kept at Oakridge National Laboratory and AT\&T Bell Laboratories. The enhanced package has been ported from the Alliant FX/8 to the Encore Multimax and Sequent Balance.

59. Jan-Jo Chen, Floyd B. Hanson, Chong-Yen Lee and Shin-Fa Wei, The path oriented synthesis of single-contact networks, in Proceedings of International Association of Science and Technology for Development International Conference on Modelling, Identification and Control , paper number 258-201, 5 pages, February 1997. (Conference held 17-19 February 1997 in Innsbruck, Austria).

This paper presents both algorithms based on multiple path switching function specifications and a transmission matrix to synthesize the single-contact networks with 2-isomorphism. Such synthesis is path oriented since the initial specifications are in terms of paths for the switching functions and transmission matrix. The algorithms broaden the scope of the conventional synthesis which is restricted to a single switching function. The necessary conditions for realizability fo the specification for a SC network, including intra- and inter-switching tests and Tutte's necessary conditions are applied before further searching of such synthesis. The cases discussed here are for a SC network can also be extended to a graph, which is especially helpful in design of topology of computer architectures and communication networks.

60. Jan-Jo Chen, Floyd B. Hanson, Chong-Yen Lee and Li-Ping Chen, The realization of single-contact networks by the multiple switching function specification and the transmission matrix, in Proceedings of the ISCA 12th International Conference on Computers and Their Applications, pp. 284-288, March 1997. (Conference held 13-15 March 1997 in Tempe, Arizona).