Abstract.The Multiple-Choice Multi-Dimension Knapsack Problem (MMKP) is a variant of the 0-1 Knapsack Problem, an NP-Hard problem. Hence algorithms for finding the exact solution of MMKP are not suitable for application in real time decision-making applications, like quality adaptation and admission control of an interactive multimedia system. This paper presents two new heuristic algorithms, M-HEU and I-HEU for solving MMKP. Experimental results suggest that M-HEU finds 96% optimal solutions on average with much reduced computational complexity and performs favorably relative to other heuristic algorithms for MMKP. The scalability property of I-HEU makes this heuristic a strong candidate for use in real time applications.

No abstract

No abstract

Abstmct-The objective of this paper is to develop a resilient mutual exclusion algorithm using a circulating token, based on time-out mechanisms, for computer networks. Suzuki and Kasami [25], 12.61 described a mutual exclusion algorithm which uses a message called a "token," to transfer the privilege of entering a critical region among the participating sites. This paper presents an extension to the Suzuki and Kasami algorithm, to make the unique token approach resilient to failures. The proposed algorithm checks whether the token is lost during network failure, and regenerates it if necessary. The mutual exclusion requirement is satisfied by guaranteeing that only one token is regenerated in the network.Failures in a computer network are classified into three types: processor failure, communication controller failure, and communication link failure. To detect failures, a time-out mechanism based on message delay is used. The execution of the algorithm is described for each type of failure; each site follows a rather simple execution procedure. firthermore, each site is not required to observe the failure of other sites or communication links. Such properties are very valuable from the viewpoint of distributed control.