Abstract:
A new procedure for multi-level dynamic memory allocation for package processing of segmented programs in parallel computers with priority servicing is described. The procedure relies on precise algorithms of discrete programming using associative data processing [1] and extending the method of Ref. [2] with regard for the specified optimality criterion.