Average （mean） voter is one of the commonest voting methods suitable for decision making in highly-available and long-missions applications where the availability and the speed of the system are critical.In this pap...Average （mean） voter is one of the commonest voting methods suitable for decision making in highly-available and long-missions applications where the availability and the speed of the system are critical.In this paper,a new generation of average voter based on parallel algorithms and parallel random access machine（PRAM） structure are proposed.The analysis shows that this algorithm is optimal due to its improved time complexity,speed-up,and efficiency and is especially appropriate for applications where the size of input space is large.展开更多
A new parallel algorithm is proposed for the knapsack problem where the method of divide and conquer is adopted. Based on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2 n/4 ) 1-ε ...A new parallel algorithm is proposed for the knapsack problem where the method of divide and conquer is adopted. Based on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2 n/4 ) 1-ε processors, 0≤ ε ≤1, and O(2 n/2 ) memory to find a solution for the n -element knapsack problem in time O(2 n/4 (2 n/4 ) ε) . The cost of the proposed parallel algorithm is O(2 n/2 ) , which is an optimal method for solving the knapsack problem without memory conflicts and an improved result over the past researches.展开更多
文摘Average （mean） voter is one of the commonest voting methods suitable for decision making in highly-available and long-missions applications where the availability and the speed of the system are critical.In this paper,a new generation of average voter based on parallel algorithms and parallel random access machine（PRAM） structure are proposed.The analysis shows that this algorithm is optimal due to its improved time complexity,speed-up,and efficiency and is especially appropriate for applications where the size of input space is large.
文摘A new parallel algorithm is proposed for the knapsack problem where the method of divide and conquer is adopted. Based on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2 n/4 ) 1-ε processors, 0≤ ε ≤1, and O(2 n/2 ) memory to find a solution for the n -element knapsack problem in time O(2 n/4 (2 n/4 ) ε) . The cost of the proposed parallel algorithm is O(2 n/2 ) , which is an optimal method for solving the knapsack problem without memory conflicts and an improved result over the past researches.
