We have developed near-optimal resource-allocation algorithms (amrmd) for tasks with multiple resources and multiple QoS dimensions (MRMD).This has been extended to the case of a trade-off situation where multiple options or resource combination exist for a task that yield the same utility. This is typically applicable in a distributed multi-processor system. The results obtained using the algorithm are very close to that of the optimal with the running time infinitesimally smaller than the same.
In case of a Large distributed system comprising of more than 50 processors, we have also developed a more scalable resource allocation scheme. A typical radar system has 64 processors and our new scheme can be used efficiently for resource-allocation of radar tasks.