Adaptively Secure Garbling Schemes for Parallel Computations

2019 ◽  
pp. 285-310
Author(s):  
Kai-Min Chung ◽  
Luowen Qian
Keyword(s):  
Parallel Computations

Asynchronous and parallel computations

2013 ◽  
pp. 311-338 ◽  
Author(s):  
Michael R. Hansen ◽  
Hans Rischel
Keyword(s):  
Parallel Computations

Load balancing instabilities due to time delays in parallel computations

2001 ◽  
Vol 34 (23) ◽  
pp. 175-179 ◽  
Author(s):  
Chaouki Abdallah ◽  
J. Douglas Birdwell ◽  
John Chiasson ◽  
Victor Chupryna ◽  
Zhong Tang ◽  
...  
Keyword(s):  
Load Balancing ◽  
Time Delays ◽  
Parallel Computations

The Problem of Scheduling Parallel Computations of Multibody Dynamic Analysis Is NP-Hard

1996 ◽  
Author(s):  
Jin-Fan Liu ◽  
Karim A. Abdel-Malek
Keyword(s):  
Dynamic Analysis ◽  
Spanning Tree ◽  
Minimum Weight ◽  
Computational Cost ◽  
Parallel Computations ◽  
Np Hard ◽  
Multibody Dynamic ◽  
Np Hard Problem ◽  
Np Complete ◽  
Minimum Weight Spanning Tree

Abstract A formulation of a graph problem for scheduling parallel computations of multibody dynamic analysis is presented. The complexity of scheduling parallel computations for a multibody dynamic analysis is studied. The problem of finding a shortest critical branch spanning tree is described and transformed to a minimum radius spanning tree, which is solved by an algorithm of polynomial complexity. The problems of shortest critical branch minimum weight spanning tree (SCBMWST) and the minimum weight shortest critical branch spanning tree (MWSCBST) are also presented. Both problems are shown to be NP-hard by proving that the bounded critical branch bounded weight spanning tree (BCBBWST) problem is NP-complete. It is also shown that the minimum computational cost spanning tree (MCCST) is at least as hard as SCBMWST or MWSCBST problems, hence itself an NP-hard problem. A heuristic approach to solving these problems is developed and implemented, and simulation results are discussed.

Sign in / Sign up

Export Citation Format

Share Document