scholarly journals One-step algorithm for mixed data and task parallel scheduling without data replication

2004 ◽  
Author(s):  
V. Boudet ◽  
F. Desprez ◽  
F. Suter
Keyword(s):  
Data Replication ◽  
Mixed Data ◽  
Parallel Scheduling ◽  
Task Parallel ◽  
One Step ◽  
Step Algorithm ◽  
And Task

Models and Scheduling Algorithms for Mixed Data and Task Parallel Programs

1997 ◽  
Vol 47 (2) ◽  
pp. 168-184 ◽  
Author(s):  
Soumen Chakrabarti ◽  
James Demmel ◽  
Katherine Yelick
Keyword(s):  
Scheduling Algorithms ◽  
Parallel Programs ◽  
Mixed Data ◽  
Task Parallel ◽  
And Task

scholarly journals An Innovative Optimization Design Procedure for Mechatronic Systems with a Multi-Criteria Formulation

2021 ◽  
Vol 11 (19) ◽  
pp. 8900
Author(s):  
Cuauhtémoc Morales-Cruz ◽  
Marco Ceccarelli ◽  
Edgar Alfredo Portilla-Flores
Keyword(s):  
Optimization Design ◽  
Optimization Problem ◽  
Heuristic Algorithms ◽  
Design Procedure ◽  
Concurrent Design ◽  
Mechatronic Systems ◽  
Design Variables ◽  
One Step ◽  
Task Oriented ◽  
And Task

This paper presents an innovative Mechatronic Concurrent Design procedure to address multidisciplinary issues in Mechatronics systems that can concurrently include traditional and new aspects. This approach considers multiple criteria and design variables such as mechanical aspects, control issues, and task-oriented features to formulate a concurrent design optimization problem that is solved using but not limited to heuristic algorithms. Furthermore, as an innovation, this procedure address all considered aspects in one step instead of multiple sequential stages. Finally, this work discusses an example referring to Mechatronic Design to show the procedure performed and the results show its capability.

A four-node membrane element model with bending modification for one-step algorithm for bus rollover impact

2015 ◽  
Vol 32 (3) ◽  
pp. 607-620 ◽  
Author(s):  
Jingxin Na ◽  
Tong Wang ◽  
Changfeng Wu ◽  
Yakun Yan
Keyword(s):  
Engineering Application ◽  
Element Model ◽  
Bending Moments ◽  
Membrane Element ◽  
Computational Accuracy ◽  
Content Type ◽  
One Step ◽  
Internal Forces ◽  
Step Algorithm ◽  
The One

Purpose – The purpose of this paper is to propose a new four-node membrane element model with bending modification based on the equilibrium principle of element nodal internal forces and bending moments for the application of the one-step algorithm for bus rollover collision. And it can be concluded whether the proposed four-node membrane element model has practical value in engineering application or not. Design/methodology/approach – Based on the equilibrium principle of element nodal internal forces and bending moments, the paper puts forward a four-node membrane element model with bending modification. A case study on the rollover of a typical bus body section is carried out by using the one-step algorithm for bus rollover collision to verify the effectiveness of the proposed element model. Findings – For the simulation of bus rollover collision, the computational accuracy can be guaranteed, meanwhile, the calculated amount is much smaller than the shell element, and computational efficiency is improved significantly. Originality/value – The proposed four-node membrane element model is used for the simulation of bus rollover collision for the first time. It holds the advantage of high computational efficiency of membrane element, and the computational accuracy is improved as well. In conclusion, it has some practical value in engineering application.

User transparent data and task parallel multimedia computing with Pyxis-DT

2013 ◽  
Vol 29 (8) ◽  
pp. 2252-2261
Author(s):  
Timo van Kessel ◽  
Ben van Werkhoven ◽  
Niels Drost ◽  
Jason Maassen ◽  
Henri E. Bal ◽  
...  
Keyword(s):  
Multimedia Computing ◽  
Task Parallel ◽  
And Task

A data and task parallel image processing environment

2002 ◽  
Vol 28 (7-8) ◽  
pp. 945-965 ◽  
Author(s):  
Cristina Nicolescu ◽  
Pieter Jonker
Keyword(s):  
Image Processing ◽  
Parallel Image Processing ◽  
Parallel Image ◽  
Task Parallel ◽  
And Task

ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS

2011 ◽  
Vol 21 (04) ◽  
pp. 461-477 ◽  
Author(s):  
NAZREEN BANU ◽  
TAISUKE IZUMI ◽  
KOICHI WADA
Keyword(s):  
Asynchronous Systems ◽  
Actual Number ◽  
Consensus Algorithms ◽  
One Step ◽  
Step Algorithm ◽  
The One

It is known that Byzantine consensus algorithms guarantee a one-step decision only in favorable situations, for instance when all processes propose the same value. Also, no one-step algorithm can support a two-step decision. In this paper, we present a novel generic one-step Byzantine algorithm, called DEX, that circumvents these impossibilities using the condition-based approach. Algorithm DEX has two distinguished features, adaptiveness and double-expedition property. Adaptiveness makes the algorithm sensitive only to the actual number of failures so that it provides fast termination for a large number of inputs when there are fewer failures (a common case in practice). The feature double-expedition property facilitates the two-step decision in addition to the one-step decision. To the best of our knowledge, the double-expedition property is a new concept introduced by this paper, and DEX is the first algorithm having such a feature. Besides, we show that our algorithm is optimal in terms of the number of processes for one-step consensus.

Numerical Methods for Solving Dynamic Equilibrium Equations

2021 ◽  
pp. 194-214
Keyword(s):  
Numerical Methods ◽  
General Principle ◽  
Degrees Of Freedom ◽  
Dynamic Equilibrium ◽  
Continuous Media ◽  
Equilibrium Equations ◽  
Numerical Resolution ◽  
Large Size ◽  
One Step ◽  
Step Algorithm

Once the number of degrees of freedom exceeds a certain number, it would be impossible to solve the dynamic equilibrium equation manually, hence the need to switch to a numerical resolution, whose general principle is to convert a dynamic equation into a static one. We are interested, for the dynamic analysis of the structures and the continuous media, in “one-step” algorithms rather than “multi-step” one. It is mainly because the systems to be solved are of large size and that it is important to minimize the number of operations and value to be memorized to the detriment, if necessary, of precision. A “one-step” algorithm, like that of Newmark, makes it possible to calculate the solution at time tn+1, starting from the solution at time tn. In addition to the disadvantage of requiring the storage of several steps, the “multi-step” algorithms such as that of Houbolt requires a startup procedure. This chapter allows the reader to enumerate and understand different numerical method with different examples.

Sign in / Sign up

Export Citation Format

Share Document