Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Parallel processing”

Implementing parallel processing for DSSAT

SIAD, S.M. · Knowledge Commons (Lakehead University) · 2023

There is a recognized need for implementing parallel computing within simulation models. Recently, there has been renewed interest in improving legacy models and their improvement in terms of hardware usage. Several studies have documented applications of environmental models using server, super- and high-performance computer frameworks. They showed that both the implementation process and the results of such simulation had potential to sharpen and to better understand biophysical processes. Nevertheless, parallelization has received limited attention in the development of the Decision Support System for Agrotechnology Transfer (DSSAT) modeling system. For the past decades, DSSAT development has been largely focused on extending the list of crop models for various crops, development of additional tools and improvement of the existing ones for its operational tasks (e.g., calibration) and better compatibility with different operating systems (OS). We addressed this gap by proposing a non-invasive method to be implemented with DSSAT that allows simulations to be run in parallel on a Windows OS. The simulation benchmark presented here confirms that there is significant decrease in execution time when splitting runs to multithreaded workload.

Cited by 0Open access

Distributed parallel processing system model

De-chun Peng, G.H. Chu, B.H. Zhang et al. · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1982

With regard to distributed parallel processing, this paper describes some characteristics of the WUPP-80 model: the communications among computers could be occured at the bus cycle level; the memory of each computer can be used by any other one, and the computers can be interrupted by each other. 12 references.

Cited by 1

Implementing parallel processing for DSSAT

SIAD, S.M. · Knowledge Commons (Lakehead University) · 2022

There is a recognized need for implementing parallel computing within simulation models. Recently, there has been renewed interest in improving legacy models and their improvement in terms of hardware usage. Several studies have documented applications of environmental models using server, super- and high-performance computer frameworks. They showed that both the implementation process and the results of such simulation had potential to sharpen and to better understand biophysical processes. Nevertheless, parallelization has received limited attention in the development of the Decision Support System for Agrotechnology Transfer (DSSAT) modeling system. For the past decades, DSSAT development has been largely focused on extending the list of crop models for various crops, development of additional tools and improvement of the existing ones for its operational tasks (e.g., calibration) and better compatibility with different operating systems (OS). We addressed this gap by proposing a non-invasive method to be implemented with DSSAT that allows simulations to be run in parallel on a Windows OS. The simulation benchmark presented here confirms that there is significant decrease in execution time when splitting runs to multithreaded workload.

Cited by 0Open access

Parallel algorithms for mesh processing

Guillaume Vialaneix · theses.fr (ABES) · 2012

Nous traitons dans cette thèse des différents aspects de la manipulation de maillages, et de la façon dont ces opérations peuvent être effectuées en parallèle, ou en mémoire distribuée, à l’heure où les GPUs comme les super-calculateurs deviennent de plus en plus utilisés. Ainsi, nous présentons des algorithmes de lissage surfacique et volumique, inspirés d’algorithmes de traitement d’images (filtre bilatéral, histogrammes locaux). Après ces manipulations de géométrie, nous abordons des problématiques topologiques comme le remaillage local, dans le but de générer, à partir d’un maillage tétraédrique, une couche limite de cellules prismatiques et hexaédriques de bonne qualité, permettant des simulations de mécanique des fluides dans ces ones proches de la surface. Enfin, nous décrivons une technique de maillage basée sur des interactions particulaires, permettant de générer des maillages à dominante quadrangulaire.

Cited by 0Open access

Parallel Processing Techniques with MATLAB

Sayed Mohammad Badiezadegan · International Journal of Science and Research (IJSR) · 2024

Assuredly, the competency of MATLAB software in scientific and engineering research could not be ignored in this era. With its powerful modules, this software can perform a lot of modern industrial or even medical research efficiently. The biggest stunning point of this outstanding software is that it can process big data even without using supercomputers by taking advantage of multiple and successful parallel processing techniques. The following article will discuss the introduction of MATLAB parallel processing techniques. Afterward, some methods to achieve the best parallel processing performance using the graphics processing unit (GPU) are explained. Finally, the comparison between CPU parallel processing and GPU parallel processing will be discussed.

Cited by 0Open access

Spline Fitting through Parallel Processing.

Kazakos,D · Defense Technical Information Center (DTIC) · 1983

In many applications there appears the need to represent a set of raw data by fitting to them a smooth function or set of functions. A great amount of theoretical work has been done within the framework of approximation theory in studying properties of curve fitting for various families of approximating functions. One of the most attractive and well structured families of approximating functions are the splines. They have been extensively studied in the mathematical literature. Splines have been very useful in statistics. In the engineering literature, spline functions have been used as approximating tools, in the areas of Systems and Pattern Recognition. In this paper the authors concentrate on a fast, parallel computation technique for fitting a spline to n equispaced data points. Existing techniques can fit splines in 0(n) time, with recursive (serial) processing of the data. The new technique is based on the use of Fast Fourier Transform, and its parallel processing capability. As a result, our technique achieves the fitting of a spline in 0(log sub 2 n) time. The n data points must be equispaced.

Cited by 0

The rice parallel processing testbed

R. C. Covington, S. Madala, Vishal Mehta et al. · ACM SIGMETRICS Performance Evaluation Review · 1988

article Free Access Share on The rice parallel processing testbed Authors: R. C. Covington Rice Univ., Houston, TX Rice Univ., Houston, TXView Profile , S. Madala Rice Univ., Houston, TX Rice Univ., Houston, TXView Profile , V. Mehta Rice Univ., Houston, TX Rice Univ., Houston, TXView Profile , J. R. Jump Rice Univ., Houston, TX Rice Univ., Houston, TXView Profile , J. B. Sinclair Rice Univ., Houston, TX Rice Univ., Houston, TXView Profile Authors Info & Claims ACM SIGMETRICS Performance Evaluation ReviewVolume 16Issue 1May 1988pp 4–11https://doi.org/10.1145/1007771.55596Published:01 May 1988Publication History 97citation481DownloadsMetricsTotal Citations97Total Downloads481Last 12 Months36Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Cited by 104Open access

Asynchronous Procedures for Parallel Processing

Sarosh Talukdar, Sam Pyo, Theo C. Giras · IEEE Transactions on Power Apparatus and Systems · 1983

Virtually all the algorithms now being used for network simulation, tracking and optimization are synchronous. They cannot be broken into parallel processes for concurrent execution without inserting a number of synchronization points. The first process to reach a synchronization point must wait for the others to catch up. The resulting delays and communication overheads often grow rapidly with the number of processors. When this happens, large numbers of processors can be used with advantage only if the synchronous algorithm is replaced with an asynchronous procedure. This is not always easy. Asynchronous procedures tend to be counter intuitive, difficult to construct and difficult to analyze. To reduce these disadvantages we will develop concepts useful in thinking about asynchronous procedures, discuss a model after which they may be patterned, introduce some new convergence results and presents some illustrations of how to construct asynchronous procedures. Finally, we will discuss an important application area-contingency constrained optimum flows.

Cited by 29

Parallel Processing — the picoChip way!

Gerald H. Hilderink, A.W.G. Duller, Gajinder Panesar et al. · 2003

This paper describes a new approach to parallel processing within the well targetted application domain of wireless communications systems, using the picoArrayTM. The picoArrayTM is a tiled-processor architecture, containing 430 heterogeneous processors, connected through a novel, compile-time scheduled interconnect. We show how the features of the picoArrayTM allow deterministic processing to be achieved, and how the tool chain allows programming to be performed effectively in a combination of high level assembly language and C. By handling a wide variety of types of processing within the picoArrayTM a single design flow can be used to produce complex communications systems. The effectiveness of this approach is demonstrated through the use of the picoArrayTM to build a working 3G base-station.

Cited by 52

Efficient Parallel Linked List Processing

Ashkan Tousimojarad, Wim Vanderbauwhede · Advances in parallel computing · 2016

OpenMP is a very popular and successful parallel programming API, but efficient parallel traversal of a list (of possibly unknown size) of items linked by pointers is a challenging task: solving the problem with OpenMP worksharing constructs requires either transforming the list into an array for the traversal or for all threads to traverse each of the elements and compete to execute them. Both techniques are inefficient. OpenMP 3.0 allows to addresses the problem using pointer chasing by a master thread and creating a task for each element of the list. These tasks can be processed by any thread in the team. In this study, we propose a more efficient cutoff-based linked list traversal using our task-based parallel programming model, GPRM. We compare the performance of this technique in both GPRM and OpenMP implementations with the conventional OpenMP implementation, which we call Task-Per-Element (TPE).

Cited by 1

Queuing Systems and Parallel Processing

Pre-Assistant, Felician Alecu · 2003

queuing system is a generic model that compr ises three elements: a user source, a queue and a service facility that contains one or more (possibly an infinite number of) identical servers in parallel. Each user of the queuing system passes through the queue where he may remain for a period of time (positive, possibly zero) and than is pro cessed by a single server because of the parallel arrangement of the servers. Once a user has left the server, after obtaining the service, the user is considered to have left the que uing system as well. [Bol90] A queuing system is formed from three generic elements (figure 1): 1. The arrival process of users in the system;

Cited by 0