Dynamic node allocation

Wu, C. H Chen, H. L. Chen, S. C. (1997). Counter-propagation neural networks for molecular sequence classification supervised LVQ and dynamic node allocation. Applied Intelligence 7,27-38. 

C. Wu, H.-L. Chen, and S.-C. Chen, Appl. Intell., 7,27 (1997). Counter-Propagation Neural Networks for Molecular Sequence Classification Supervised LVQ and Dynamic Node Allocation. 

FIFO ordering for global requests can easily be implemented as an ordered list, either dynamic or static. It is worth noting that MrsP can do with simple fixed-length lists because the maximum length of the FIFO queue is known a-priori, independently from the specific application, as the number of processors available determines the maximum degree of parallelism for the platform. The use of a dynamic list is also a viable option since each task can participate at most in one FIFO queue, it is possible to statically allocate a node for each task, and then add or remove it from a specific resource list when required. 

---