An intelligent allocation algorithm for parallel processing

The problem of allocating nodes of a program graph to processors in a parallel processing architecture is considered. The algorithm is based on critical path analysis, some allocation heuristics, and the execution granularity of nodes in a program graph. These factors, and the structure of interprocessor communication network, influence the allocation. To achieve realistic estimations of the executive durations of allocations, the algorithm considers the fact that nodes in a program graph have to communicate through varying numbers of tokens. Coarse and fine granularities have been implemented, with interprocessor token-communication duration, varying from zero up to values comparable to the execution durations of individual nodes. The effect on allocation of communication network structures is demonstrated by performing allocations for crossbar (non-blocking) and star (blocking) networks. The algorithm assumes the availability of as many processors as it needs for the optimal allocation of any program graph. Hence, the focus of allocation has been on varying token-communication durations rather than varying the number of processors. The algorithm always utilizes as many processors as necessary for the optimal allocation of any program graph, depending upon granularity and characteristics of the interprocessor communication network

Dynamic behavior of a magnetic bearing supported jet engine rotor with auxiliary bearings

This paper presents a study of the dynamic behavior of a rotor system supported by auxiliary bearings. The steady-state behavior of a simulation model based upon a production jet engine is explored over a wide range of operating conditions for varying rotor imbalance, support stiffness and damping. Interesting dynamical phenomena, such as chaos, subharmonic responses, and double-valued responses, are presented and discussed

US elections and monthly stock market returns

Market Returns, Election, Democratic, Republican, G10, G18,