Готові списки джерел за темами / Parallel and sequential regions

Добірка наукової літератури з теми "Parallel and sequential regions"

Автор: Grafiati
Опубліковано: 10 грудня 2022
Оновлено: 28 січня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Parallel and sequential regions".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Parallel and sequential regions"

1

del Rio Astorga, David, Manuel F. Dolz, Luis Miguel Sánchez, J. Daniel García, Marco Danelutto, and Massimo Torquati. "Finding parallel patterns through static analysis in C++ applications." International Journal of High Performance Computing Applications 32, no. 6 (March 9, 2017): 779–88. http://dx.doi.org/10.1177/1094342017695639.

Повний текст джерела
Анотація:
Since the ‘free lunch’ of processor performance is over, parallelism has become the new trend in hardware and architecture design. However, parallel resources deployed in data centers are underused in many cases, given that sequential programming is still deeply rooted in current software development. To address this problem, new methodologies and techniques for parallel programming have been progressively developed. For instance, parallel frameworks, offering programming patterns, allow expressing concurrency in applications to better exploit parallel hardware. Nevertheless, a large portion of production software, from a broad range of scientific and industrial areas, is still developed sequentially. Considering that these software modules contain thousands, or even millions, of lines of code, an extremely large amount of effort is needed to identify parallel regions. To pave the way in this area, this paper presents Parallel Pattern Analyzer Tool, a software component that aids the discovery and annotation of parallel patterns in source codes. This tool simplifies the transformation of sequential source code to parallel. Specifically, we provide support for identifying Map, Farm, and Pipeline parallel patterns and evaluate the quality of the detection for a set of different C++ applications.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Qawasmeh, Ahmad, Salah Taamneh, Ashraf H. Aljammal, Nabhan Hamadneh, Mustafa Banikhalaf, and Mohammad Kharabsheh. "Parallelism exploration in sequential algorithms via animation tool." Multiagent and Grid Systems 17, no. 2 (August 23, 2021): 145–58. http://dx.doi.org/10.3233/mgs-210347.

Повний текст джерела
Анотація:
Different high performance techniques, such as profiling, tracing, and instrumentation, have been used to tune and enhance the performance of parallel applications. However, these techniques do not show how to explore the potential of parallelism in a given application. Animating and visualizing the execution process of a sequential algorithm provide a thorough understanding of its usage and functionality. In this work, an interactive web-based educational animation tool was developed to assist users in analyzing sequential algorithms to detect parallel regions regardless of the used parallel programming model. The tool simplifies algorithms’ learning, and helps students to analyze programs efficiently. Our statistical t-test study on a sample of students showed a significant improvement in their perception of the mechanism and parallelism of applications and an increase in their willingness to learn algorithms and parallel programming.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

P Sajan, Priya, and S. S. Kumar. "GVF snake algorithm-a parallel approach." International Journal of Engineering & Technology 7, no. 1.1 (December 21, 2017): 101. http://dx.doi.org/10.14419/ijet.v7i1.1.9206.

Повний текст джерела
Анотація:
Multicore architecture is an emerging computer technology where multiple processing element will be acting as independent processing cores by sharing a common memory. Digital image segmentation is a widely used medical imaging application to extract regions of interest. GVF Active Contour is a region based segmentation technique which extracts curved and irregular shaped regions by diffusing gradient vectors and by the influence of internal and external forces. This requires prior knowledge on the geometric position and anatomical structures to locate the specific region defined within an image domain. This process requires complex mathematical calculations which in turn results in the immense consumption of CPU processing time. This may adversely affect the overall performance efficiency of the process. With the advancements in multicore technology, this processing time delay can be reduced by adapting parallelization in the computation of GVF field to the specific region of interest which is to be segmented. OpenMP is a shared memory parallel programming construct, which could implement multicore parallelism with extensive and powerful APIs thereby supporting the functionalities required to attain parallelism. This article provides a high level overview of OpenMP, its effectiveness and ease of implementation in adapting parallelism to existing traditional sequential methods using instruction, data and loop level parallelism. Performance comparison could be done with sequential versions of the program written in Matlab, Java and C languages with the proposed parallelized version of OpenMP. The result is also comparable with different operating systems like Windows and Linux.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Zabiri, Haslinda, M. Ariff, Lemma Dendena Tufa, and Marappagounder Ramasamy. "A Comparison Study between Integrated OBFARX-NN and OBF-NN for Modeling of Nonlinear Systems in Extended Regions of Operation." Applied Mechanics and Materials 625 (September 2014): 382–85. http://dx.doi.org/10.4028/www.scientific.net/amm.625.382.

Повний текст джерела
Анотація:
In this paper the combination of linear and nonlinear models in parallel for nonlinear system identification is investigated. A residuals-based sequential identification algorithm using parallel integration of linear Orthornormal basis filters-Auto regressive with exogenous input (OBFARX) and a nonlinear neural network (NN) models is developed. The model performance is then compared against previously developed parallel OBF-NN model in a nonlinear CSTR case study in extended regions of operation (i.e. extrapolation capability).
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Akyildiz, Ömer Deniz, Dan Crisan, and Joaquín Míguez. "Parallel sequential Monte Carlo for stochastic gradient-free nonconvex optimization." Statistics and Computing 30, no. 6 (July 29, 2020): 1645–63. http://dx.doi.org/10.1007/s11222-020-09964-4.

Повний текст джерела
Анотація:
Abstract We introduce and analyze a parallel sequential Monte Carlo methodology for the numerical solution of optimization problems that involve the minimization of a cost function that consists of the sum of many individual components. The proposed scheme is a stochastic zeroth-order optimization algorithm which demands only the capability to evaluate small subsets of components of the cost function. It can be depicted as a bank of samplers that generate particle approximations of several sequences of probability measures. These measures are constructed in such a way that they have associated probability density functions whose global maxima coincide with the global minima of the original cost function. The algorithm selects the best performing sampler and uses it to approximate a global minimum of the cost function. We prove analytically that the resulting estimator converges to a global minimum of the cost function almost surely and provide explicit convergence rates in terms of the number of generated Monte Carlo samples and the dimension of the search space. We show, by way of numerical examples, that the algorithm can tackle cost functions with multiple minima or with broad “flat” regions which are hard to minimize using gradient-based techniques.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Malakar, Preeti, Thomas George, Sameer Kumar, Rashmi Mittal, Vijay Natarajan, Yogish Sabharwal, Vaibhav Saxena, and Sathish S. Vadhiyar. "A Divide and Conquer Strategy for Scaling Weather Simulations with Multiple Regions of Interest." Scientific Programming 21, no. 3-4 (2013): 93–107. http://dx.doi.org/10.1155/2013/682356.

Повний текст джерела
Анотація:
Accurate and timely prediction of weather phenomena, such as hurricanes and flash floods, require high-fidelity compute intensive simulations of multiple finer regions of interest within a coarse simulation domain. Current weather applications execute these nested simulations sequentially using all the available processors, which is sub-optimal due to their sub-linear scalability. In this work, we present a strategy for parallel execution of multiple nested domain simulations based on partitioning the 2-D processor grid into disjoint rectangular regions associated with each domain. We propose a novel combination of performance prediction, processor allocation methods and topology-aware mapping of the regions on torus interconnects. Experiments on IBM Blue Gene systems using WRF show that the proposed strategies result in performance improvement of up to 33% with topology-oblivious mapping and up to additional 7% with topology-aware mapping over the default sequential strategy.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Chapuis, Guillaume, Mathilde Le Boudic-Jamin, Rumen Andonov, Hristo Djidjev, and Dominique Lavenier. "Parallel Seed-Based Approach to Multiple Protein Structure Similarities Detection." Scientific Programming 2015 (2015): 1–12. http://dx.doi.org/10.1155/2015/279715.

Повний текст джерела
Анотація:
Finding similarities between protein structures is a crucial task in molecular biology. Most of the existing tools require proteins to be aligned in order-preserving way and only find single alignments even when multiple similar regions exist. We propose a new seed-based approach that discovers multiple pairs of similar regions. Its computational complexity is polynomial and it comes with a quality guarantee—the returned alignments have both root mean squared deviations (coordinate-based as well as internal-distances based) lower than a given threshold, if such exist. We do not require the alignments to be order preserving (i.e., we consider nonsequential alignments), which makes our algorithm suitable for detecting similar domains when comparing multidomain proteins as well as to detect structural repetitions within a single protein. Because the search space for nonsequential alignments is much larger than for sequential ones, the computational burden is addressed by extensive use of parallel computing techniques: a coarse-grain level parallelism making use of available CPU cores for computation and a fine-grain level parallelism exploiting bit-level concurrency as well as vector instructions.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Cruz, Henry, Martina Eckert, Juan M. Meneses, and J. F. Martínez. "Fast Evaluation of Segmentation Quality with Parallel Computing." Scientific Programming 2017 (2017): 1–9. http://dx.doi.org/10.1155/2017/5767521.

Повний текст джерела
Анотація:
In digital image processing and computer vision, a fairly frequent task is the performance comparison of different algorithms on enormous image databases. This task is usually time-consuming and tedious, such that any kind of tool to simplify this work is welcome. To achieve an efficient and more practical handling of a normally tedious evaluation, we implemented the automatic detection system, with the help of MATLAB®’s Parallel Computing Toolbox™. The key parts of the system have been parallelized to achieve simultaneous execution and analysis of segmentation algorithms on the one hand and the evaluation of detection accuracy for the nonforested regions, such as a study case, on the other hand. As a positive side effect, CPU usage was reduced and processing time was significantly decreased by 68.54% compared to sequential processing (i.e., executing the system with each algorithm one by one).
Стилі APA, Harvard, Vancouver, ISO та ін.
9

LI, SHAODA, MINGZHE LIU, MIN ZHOU, and YIZHANG YIN. "STUDY OF RANDOM PARTICLE TRAFFIC ON A MULTI-LATTICE JUNCTION." Modern Physics Letters B 27, no. 09 (March 15, 2013): 1350063. http://dx.doi.org/10.1142/s0217984913500632.

Повний текст джерела
Анотація:
In this paper, we investigate particle traffic on an m-input n-output (MINO) junction using totally asymmetric exclusion processes (TASEPs) under random sequential update. The model is suitable for description of biological transport. A general theoretical solution for traffic dynamics of TASEPs is developed based on a mean-field approximation. It is found that the low-density and high-density regions can be calculated qualitatively and quantitatively once the number of m and/or n is determined. The phase diagram, system current and density profiles are obtained through theoretical analysis and supported by Monte Carlo simulations. Comparison between a m-input n-output TASEP junction in random and parallel sequential updates has also been reported.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

YASHIN, Sergei N., Egor V. KOSHELEV, and Aleksandr V. KUPTSOV. "Developing an Industry and Innovation Cluster Strategy Through the Parallel and Sequential Real Options Method." Finance and Credit 27, no. 8 (August 30, 2021): 1724–47. http://dx.doi.org/10.24891/fc.27.8.1724.

Повний текст джерела
Анотація:
Subject. This article considers the issues of formation of an innovation and industrial cluster's strategy through the parallel and sequential real options method. Objectives. The article aims to develop an innovation and industrial cluster's strategy formation methodology using parallel and sequential real options. Methods. For the study, we used the compound real options technique. Results. The article presents an original methodology for developing an innovation and industrial cluster's development strategy, taking into account the assessment of the priorities of the cluster itself and the region where it is located. The process of forming a strategy for the development of a pilot cluster of the electric power industry in the Nizhny Novgorod Oblast, represented by PAO TNS Energo NN, is considered as a case study of the implementation of the presented methodology. Conclusions and Relevance. The presented methodology will help further realize the innovative potential available in the region. The results obtained can be useful to public authorities when planning the development of industrial and innovation clusters and the harmonious development of the country's regions.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Parallel and sequential regions"

1

Thornley, John William Chandy K. Mani Chandy K. Mani. "A parallel programming model with sequential semantics /." Diss., Pasadena, Calif. : California Institute of Technology, 1996. http://resolver.caltech.edu/CaltechETD:etd-01042008-085720.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Manthey, Norbert. "Towards Next Generation Sequential and Parallel SAT Solvers." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-158672.

Повний текст джерела
Анотація:
This thesis focuses on improving the SAT solving technology. The improvements focus on two major subjects: sequential SAT solving and parallel SAT solving. To better understand sequential SAT algorithms, the abstract reduction system Generic CDCL is introduced. With Generic CDCL, the soundness of solving techniques can be modeled. Next, the conflict driven clause learning algorithm is extended with the three techniques local look-ahead, local probing and all UIP learning that allow more global reasoning during search. These techniques improve the performance of the sequential SAT solver Riss. Then, the formula simplification techniques bounded variable addition, covered literal elimination and an advanced cardinality constraint extraction are introduced. By using these techniques, the reasoning of the overall SAT solving tool chain becomes stronger than plain resolution. When using these three techniques in the formula simplification tool Coprocessor before using Riss to solve a formula, the performance can be improved further. Due to the increasing number of cores in CPUs, the scalable parallel SAT solving approach iterative partitioning has been implemented in Pcasso for the multi-core architecture. Related work on parallel SAT solving has been studied to extract main ideas that can improve Pcasso. Besides parallel formula simplification with bounded variable elimination, the major extension is the extended clause sharing level based clause tagging, which builds the basis for conflict driven node killing. The latter allows to better identify unsatisfiable search space partitions. Another improvement is to combine scattering and look-ahead as a superior search space partitioning function. In combination with Coprocessor, the introduced extensions increase the performance of the parallel solver Pcasso. The implemented system turns out to be scalable for the multi-core architecture. Hence iterative partitioning is interesting for future parallel SAT solvers. The implemented solvers participated in international SAT competitions. In 2013 and 2014 Pcasso showed a good performance. Riss in combination with Copro- cessor won several first, second and third prices, including two Kurt-Gödel-Medals. Hence, the introduced algorithms improved modern SAT solving technology.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Howells, Paul. "Communicating sequential processes with flexible parallel termination semantics." Thesis, University of Westminster, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433839.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Goldberg, Andrew Vladislav. "Efficient graph algorithms for sequential and parallel computers." Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14912.

Повний текст джерела
Анотація:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.
MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.
Bibliography: p. 117-123.
by Andrew Vladislav Goldberg.
Ph.D.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Kercher, James P. Baer Tomas. "On parallel and sequential dissociations in energy selected ions." Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2006. http://dc.lib.unc.edu/u?/etd,577.

Повний текст джерела
Анотація:
Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2006.
Title from electronic title page (viewed Oct. 10, 2007). "... in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Chemistry." Discipline: Chemistry; Department/School: Chemistry.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Wang, Ting. "Algorithms for parallel and sequential matrix-chain product problem." Ohio : Ohio University, 1997. http://www.ohiolink.edu/etd/view.cgi?ohiou1184355429.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Tabirca, Sabin Marius. "Sequential and parallel aspects of the maximum flow problem." Thesis, Brunel University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.391747.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Arigu, Moses Azimeh. "Parallel and sequential algorithms for hyperbolic partial differential equations." Thesis, Brunel University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.357705.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Kapsalis, A. "Genetic algorithms : sequential and parallel implementations and case studies." Thesis, University of East Anglia, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318080.

Повний текст джерела
Анотація:
Practical issues concerning the implementation and application of genetic algorithms to a number of optimisation problems are the main subjects dealt with in this thesis. Genetic algorithms (GAs) are an attractive class of computational models that attempt to mimic the mechanisms of natural evolution to solve problems in a wide variety of domains. A general purpose genetic algorithm toolkit is developed and applied to the Steiner Problem in Graphs and the Radio Link Frequency Assignment Problem. The toolkit is then extended to cover a large number of parallel genetic algorithm models which are then compared. Solutions for the two case studies are presented with each of the parallel GAs. The thesis begins with a general introduction to genetic algorithms. Holland's original genetic algorithm is described and it's workings illustrated on a simple function minimisation problem. The notion of a schema or similarity template as a basic building block in genetic algorithms is introduced and the schema theory presented. A description of important theoretical results is given and the introduction to genetic algorithms continues with practical issues that are dealt with in the second chapter. The basic components of a modern genetic algorithm are outlined and examples for important components, as found in the Jiterature, are given. The second chapter concludes with the description of a number of applications of genetic algorithms to areas such as function optimisation, combinatorial optimisation, genetic programming, process control and classifier systems. In Chapter 3, the sequential GA toolkit, GAmeter, is described. The General Search paradigm around which the toolkit is implemented is introduced. Notable characteristics of the genetic algorithms kernel and the user interface are mentioned. A popular function optimisation problem is used to illustrate important aspects of genetic algorithms and aspects specific to the toolkit. The Steiner Tree problem in graphs is the first of two case studies examined in detail in this thesis. This is a popular NP-complete problem with a range of applications in areas such as communications, scheduling and printed circuit design. A survey of standard techniques, such as simplification methods, exact algorithms and heuristics is given. Two possible representations for solving it using genetic algorithms are described and applied to a well-known set of problems. Chapter 4 concludes with a comparison of the best GA technique with other heuristics for this problem. The Radio Link Frequency Assignment Problem, described in Chapter 5, is the second case study investigated in this thesis. Genetic algorithms were applied to this problem as part of a EUCLID (European Cooperation for the Long Term in Defence) funded multi-national study to compare exact and heuristic techniques for hard combinatorial problems associated with military applications. A number of approaches used to solve this highly constrained, hard problem for genetic algorithms are described. These include a range of new genetic operators and catalytic terms that are added to the fitness function. Apart from the direct approach to solving this problem using genetic algorithms, for which the majority of operators and catalytic terms apply, an indirect approach which combines genetic algorithms with backtracking is described. The possibility of using a meta genetic algorithm to chose the best of a multitude of options, e.g. genetic operators and parameter settings for a GA applied to the Radio Link Frequency Assignment Problem is investigated. Results are reported for two sets of problems that were used by all participants in this project. An overview of the techniques investigated for this project is given and the chapter concludes with comparisons between all these techniques. In Chapter 6, an overview of general aspects in parallel processing is given. Parallel computer architectures, parallel programming paradigms and performance measurement are the main subjects dealt with in this chapter. Special emphasis is given to material relevant to the investigation on parallel genetic algorithms, presented in the following chapter. In Chapter 7, parallel genetic algorithms are examined in some detail. A number of parallel GA models are described and classified according to whether they are designed around the sequential GA or around a more natural model. A ParallelSequential General Search paradigm is presented that unifies the various parallel models and is used to extend the GA toolkit into a parallel GA toolkit for a parallel system based on Transputers. The parallel GA models are applied to problems from both of the case studies considered in this thesis. A comparison between the various parallel GA models concludes this chapter. The thesis finishes with a summary of a number of conclusions drawn from this research together with some suggestions for how this work may be continued in the future.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Newton, Matthew. "Sequential and parallel algorithms for low-crossing graph drawing." Thesis, Loughborough University, 2007. https://dspace.lboro.ac.uk/2134/12944.

Повний текст джерела
Анотація:
The one- and two-sided bipartite graph drawing problem alms to find a layout of a bipartite graph, with vertices of the two parts placed on parallel imaginary lines, that has the minimum number of edge-crossings. Vertices of one part are in fixed positions for the one-sided problem, whereas all vertices are free to move along their lines in the two-sided version. Many different heuristics exist for finding approximations to these problems, which are NP-hard. New sequential and parallel methods for producing drawings with low edgecrossings are investigated and compared to existing algorithms, notably Penalty Minimisation and Sifting, the current leaders. For the one-sided problem, new methods that include those based on simple stochastic hillclimbing, simulated annealing and genet.ic algorithms were tested. The new block-crossover genetic algorithm produced very good results with lower crossings than existing methods, although it tended to be slower. However, time was a secondary aim, the priority being to achieve low numbers of crossings. This algorithm can also be seeded with the output of an existing algorithm to improve results; combining with Penalty Minimisation in this way improved both the speed and number of crossings. Four parallel methods for the one-sided problem have been created, although two were abandoned because they gave bad results for even simple graphs. The other two methods, based on stochastic hill-climbing, produced acceptable results in faster times than similar sequential methods. PVM was used as the parallel communication system. Two new heuristics were studied for the two-sided problem, for which the only known existing method is to apply one-sided algorithms iteratively. The first is based on a heuristic for the linear arrangment problem; the second is a method of performing stochastic hill-climbing on two sides. A way of applying anyone-sided algorithm iteratively was also created. The linear arrangement method based on the Koren-Harel multi-scale algorithm achieved the best results, outperforming iterative Barycentre (previously the best method) and iterative Penalty Minimisation. Another area of this work created three new heuristics for the k-planar drawing problem where k > 1. These are the first known practical algorithms to solve this problem. A sequential genetic algorithm based on TimGA is devised to work on k-planar graphs. Two parallel algorithms, one island model and the other a 'mesh' model, are also given. Comparison of results for k = 2 indicate that the parallel island method is better than the other two methods. MPI was used for the parallel communication. Overall, 14 new methods are introduced, of which 10 were developed into working algorithms. For the one-sided bipartite graph drawing problem the new block-crossover genetic algorithm can produce drawings with lower crossings than the current best available algorithms. The parallel methods do not perform as well as the sequential ones, although they generally achieved the same results faster. All of the new two-sided methods worked well; the weighted two-sided swap stochastic hill-climbing method was comparable to the existing best method, iterative Barycentre, and generally produced drawings with lower crossings, although it suffered with needing a good termination condition. The new methods based on the linear arrangement problem consistently produced drawings with lower crossings than iterative Barycentre, although they were nearly always slower. A new parallel algorithm for the k-planar drawing problem, based on the island model, generally created drawings with the lowest edge-crossings, although no algorithms were known to exist to make comparisons.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Parallel and sequential regions"

1

Best, Eike. Semantics of sequential and parallel programs. London: Prentice Hall, 1996.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Miller, Russ. Algorithms, sequential & parallel: A unified approach. Upper Saddle River, N.J: Prentice Hall, 2000.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

L, Paul Jerome, ed. Fundamentals of sequential and parallel algorithms. Boston: PWS Pub., 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Communicating sequential processes. Englewood Cliffs, N.J: Prentice-Hall, 1985.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Communicating sequential processes. Englewood Cliffs, N.J: Prentice/Hall International, 1985.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Laurence, Boxer, ed. Algorithms sequential and parallel: A unified approach. 2nd ed. Hingham, MA: Charles River Media, 2005.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Loch, C. H. Parallel and sequential testing of design alternatives. Fontainebleau: INSEAD, 1999.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Kronsjö, Lydia I. Computational complexity of sequential and parallel algorithms. Chichester: Wiley, 1986.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Sanders, Peter, Kurt Mehlhorn, Martin Dietzfelbinger, and Roman Dementiev. Sequential and Parallel Algorithms and Data Structures. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25209-0.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Kronsjö, Lydia. Computational complexity of sequential and parallel algorithms. Chichester: Wiley, 1985.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Parallel and sequential regions"

1

Dongarra, Jack, Piotr Luszczek, Felix Wolf, Jesper Larsson Träff, Patrice Quinton, Hermann Hellwagner, Martin Fränzle, et al. "Sequential Consistency." In Encyclopedia of Parallel Computing, 1810. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_2049.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

van den Broek, Egon L., and Eva M. van Rikxoort. "Parallel-Sequential Texture Analysis." In Pattern Recognition and Image Analysis, 532–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11552499_59.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Fan, Wenfei, Muyang Liu, Ruiqi Xu, Lei Hou, Dongze Li, and Zizhong Meng. "Think Sequential, Run Parallel." In Lecture Notes in Computer Science, 1–25. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01461-2_1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Souravlias, Dimitris, Konstantinos E. Parsopoulos, Ilias S. Kotsireas, and Panos M. Pardalos. "Sequential and Parallel Models." In SpringerBriefs in Optimization, 45–51. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68514-0_5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Steele, Guy L., Xiaowei Shen, Josep Torrellas, Mark Tuckerman, Eric J. Bohm, Laxmikant V. Kalé, Glenn Martyna, et al. "CSP (Communicating Sequential Processes)." In Encyclopedia of Parallel Computing, 478–82. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_186.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Steele, Guy L., Xiaowei Shen, Josep Torrellas, Mark Tuckerman, Eric J. Bohm, Laxmikant V. Kalé, Glenn Martyna, et al. "Communicating Sequential Processes (CSP)." In Encyclopedia of Parallel Computing, 341. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_2073.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Fahringer, Thomas. "Sequential Program Parameters." In Automatic Performance Prediction of Parallel Programs, 47–71. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1371-7_3.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Apt, Krzysztof R., and Ernst-Rüdiger Olderog. "Disjoint Parallel Programs." In Verification of Sequential and Concurrent Programs, 101–24. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4757-2714-2_4.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Apt, Krzysztof R., and Ernst-Rüdiger Olderog. "Disjoint Parallel Programs." In Verification of Sequential and Concurrent Programs, 179–206. New York, NY: Springer New York, 1991. http://dx.doi.org/10.1007/978-1-4757-4376-0_5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Woods, Damien, and Thomas J. Naughton. "Parallel and Sequential Optical Computing." In Lecture Notes in Computer Science, 70–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-85673-3_6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Parallel and sequential regions"

1

Gonza´lez, Francisco, Alberto Luaces, Daniel Dopico, and Manuel Gonza´lez. "Parallel Linear Equation Solvers and OpenMP in the Context of Multibody System Dynamics." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-86274.

Повний текст джерела
Анотація:
Computational efficiency of numerical simulations is a key issue in multibody system (MBS) dynamics, and parallel computing is one of the most promising approaches to increase the computational efficiency of MBS dynamic simulations. The present work evaluates two non-intrusive parallelization techniques for multibody system dynamics: parallel sparse linear equation solvers and OpenMP. Both techniques can be applied to existing simulation software with minimal changes in the code structure; this is a major advantage over MPI (Message Passing Interface), the de facto standard parallelization method in multibody dynamics. Both techniques have been applied to parallelize a starting sequential implementation of a global index-3 augmented Lagrangian formulation combined with the trapezoidal rule as numerical integrator, in order to solve the forward dynamics of a variable number of loops four-bar mechanism. This starting implementation represented a highly optimized code, where the overhead of parallelization would represent a considerable part of the total amount of elapsed time in calculations. Several multi-threaded solvers have been added to the original software. In addition, parallelizable regions of the code have been detected and multi-threaded via OpenMP directives. Numerical experiments have been performed to measure the efficiency of the parallelized code as a function of problem size and matrix filling ratio. Results show that the best parallel solver (Pardiso) performs better than the best sequential solver (CHOLMOD) for multibody problems of large and medium sizes leading to matrix fillings above 10 non-zeros per variable. OpenMP also proved to be advantageous even for problems of small sizes, in despite of the small percentage of parallelizable workload with respect to the total burden of the execution of the code. Both techniques delivered speedups above 70% of the maximum theoretical values for a wide range of multibody problems.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Bonert, Michael, Jerry G. Myers, Stephen E. Fremes, and C. Ross Ethier. "Influence of Graft/Host Diameter Ratio on the Hemodynamics in Sequential ITA Anastomoses." In ASME 2000 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/imece2000-2612.

Повний текст джерела
Анотація:
Abstract Multivessel grafting with internal thoracic artery (ITA) conduits may improve the long-term results of coronary surgery for patients with multivessel coronary disease. Sequential ITA grafting has been increasingly used as a means of allowing a single ITA to revascularize a greater amount of the myocardium (Izzat et al, 1994). In this procedure, the graft first supplies blood to a coronary artery via a side-to-side anastomoses and then delivers blood to a second site in the coronary vasculature through an end-to-side anastomosis. However, it is unclear if the complex geometry and hemodynamic patterns in the side-to-side anastomosis contribute to the development of intimal hyperplasia, as reported for end-to-side anastomoses (Bassiouny et al. 1992). In a previous study we studied the hemodynamics of side-to-side anastomosis when graft and host diameters are equal (Bonert et al., 1999). In this study, we examined the wall shear stress (WSS) characteristics in idealized models of a “parallel” and a “diamond” side-to-side anastomoses for the case in which the graft diameter is substantially larger than the host diameter (Lei et al., 1996). Regions of specific interest were those exhibiting low WSS and rapidly changing WSS (high spatial WSS gradient) both of which have been suggested to promote intimal hyperplasia.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Sawyer, Mikel L., Aly H. Shaaban, and Reza Salavani. "A Minichannel Heat Exchanger System for Heating, Boiling, and Superheating Water by Radiant Combustion." In ASME 2004 Heat Transfer/Fluids Engineering Summer Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/ht-fed2004-56582.

Повний текст джерела
Анотація:
A minichannel steam generator is being developed for a fuel reformer. The reformer will convert jet fuel to a hydrogen-rich stream for a 10 kW fuel cell. A first model has been built and tested. It was a once-through design with of two sequential heat exchangers. Exhaust gases produced saturated liquid in the first unit. The second surrounded a radiant propane burner. The system heated 1.2 to 2.6 gm/s of de-ionized water to more than 650 °C at exit pressures from 106 to 240 kPa. These flows and temperatures meet the requirements for the 10 kW fuel reformer. The minichannel system operated across three regimes: liquid heating, boiling, and superheating. It used multiple channels in parallel. At certain locations, the number of the parallel channels was changed to restrain the total pressure drop. The channel hydraulic diameter was 0.14 cm. The Reynolds number for the water ranged from 620 to 1,260 in the boiling section and from 1,260 to 3,140 in the superheating section, based on averaged fluid properties. The total pressure drop in the heat exchanger pair ranged from 470 to 870 kPa. The water absorbed heat fluxes ranging from 0.3 to 1.2 W/cm2 in the single-phase regions and 4.7 to 9.8 W/cm2 in the boiling region. These values were based on the wetted wall area. The boiling data falls in the range of published results for similar mass flux. An increased capacity for absorbing heat flux was demonstrated as coolant mass flux or Reynolds number increased. This paper also discusses the reasons for calculating heat flux based on heated area and based on wetted channel area. The need to identify clearly the basis of heat flux is addressed.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Freitas, Henrique R. A., and Celso Mendes. "Parallelization of a Large-Scale Watersheds Hydrological Model using CPU and GPU." In Escola Regional de Alto Desempenho de São Paulo. Sociedade Brasileira de Computação, 2018. http://dx.doi.org/10.5753/eradsp.2018.13604.

Повний текст джерела
Анотація:
Hydrological models are commonly employed to calculate water flows on rivers and watersheds for the analysis of extreme events in nature. Computations in these models can grow depending on the numerical method, and also on the spatial and temporal resolutions, thus affecting the model efficiency and utility. This work parallelizes the MGB hydrological model on either CPU with OpenMP or GPU with OpenACC, respectively, aiming at the improvement in performance by employing computing resources of an HPC system. An analysis of the sequential and parallel executions is presented together with the runtime, speedup, efficiency, and load balance achieved.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Yavas, Denizhan, Burak Gozluklu, and Demirkan Coker. "Failure Mode Transition During Delamination of Thick Unidirectional L-Shaped Composite Laminates." In ASME 2012 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/imece2012-88409.

Повний текст джерела
Анотація:
Curved composite laminates such as L-beams are frequently used in wind turbine blade structures such as spars and ribs. It is widely assumed that delamination initiates at the curved region of the L-shaped laminate leading to loss of loading carrying capacity. However, as shown in this paper, under certain conditions a second failure mode in thick L-shaped laminates is observed in which a secondary crack initiates at the arm region. Delamination in L-shaped laminates is modeled using a sequential analysis with implicit analysis followed by explicit dynamic (explicit) finite element analysis in conjunction with cohesive zone methods. The 2-D model consists of 24 plies of unidirectional CFRP laminate with an initial crack at the center of curved region. Loading is applied parallel to one arm quasi-statically and the observed delamination occurs dynamically. For thin laminates and larger precracks, delamination starts from the initial crack and propagates towards the arms. For thicker L-shaped laminates and smaller precracks at the center of curved region, formation of secondary crack in the arm region is observed. Therefore the size of the initial crack as a function of thickness at the center of the curved region mainly decides the failure mode.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

He, Xiao, Xinqian Zheng, Jie Wei, and Hanxuan Zeng. "Investigation of Vaned Diffuser Splitters on the Performance and Flow Control of High Pressure Ratio Centrifugal Compressors." In ASME Turbo Expo 2016: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/gt2016-56255.

Повний текст джерела
Анотація:
High pressure ratio centrifugal compressors with vaned diffusers are required in modern gas turbine engines. A potential method to further improve the performance of such compressors is to apply splitters to the vaned diffuser. This paper numerically investigates design choices of splitters in a vaned diffuser of a high pressure ratio centrifugal compressor. The splitters are derived from the main vane but with different chord length. The total vane number has been adjusted to maintain the same diffuser flow capability relative to the impeller. When the splitter is designed in the vaned region of the datum diffuser, the flow separation has been successfully suppressed with increasing relative splitter chord length from 0.10 to 0.70. At high mass flow rate conditions, the stage efficiency and the diffuser pressure recovery coefficient increases by 1.0% and 0.04 respectively due to the suppression of the flow separation. However, at design mass flow rate, the stage efficiency and the diffuser pressure recovery coefficient drops slightly by 0.3% and 0.01 respectively because the enhanced friction loss of vane surfaces is now dominant. When the splitter vane reaches the semi-vaneless region by further increasing its chord length from 0.8 to 0.95, the shock structure changes from two parallel shocks to two sequential shocks at first, but turns to the datum shock structure at last. The stage efficiency and the diffuser pressure recovery coefficient of the sequential shock structural case significantly drops by 0.7% and 0.03 respectively due to the increased shock strength and thus the higher shock loss. It is indicated that the application of splitter vanes in the vaned region of the diffuser is beneficial when the induced friction loss from splitter surfaces is less significant or the reduced loss from the suppressed flow separation is more dominant, which is the case that the flow separation happens relatively downstream or the case operating at large incidence conditions.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Brauner, Paul, and Walid Mohamed Taha. "Globally parallel, locally sequential." In the 9th Workshop. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/2039312.2039314.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Appelbe, Bill, and Batakrishnan Lakshmanan. "Optimizing Parallel Programs Using Affinity Regions." In 1993 International Conference on Parallel Processing - ICPP'93 Vol2. IEEE, 1993. http://dx.doi.org/10.1109/icpp.1993.131.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Razanajato, Harenome, Cidric Bastoul, and Vincent Loechner. "Lifting Barriers Using Parallel Polyhedral Regions." In 2017 IEEE 24th International Conference on High Performance Computing (HiPC). IEEE, 2017. http://dx.doi.org/10.1109/hipc.2017.00046.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Cong, Shengnan, Jiawei Han, and David Padua. "Parallel mining of closed sequential patterns." In Proceeding of the eleventh ACM SIGKDD international conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1081870.1081937.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Parallel and sequential regions"

1

Datta, Biswa N. Sequential and Parallel Matrix Computations. Fort Belvoir, VA: Defense Technical Information Center, November 1985. http://dx.doi.org/10.21236/ada166062.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Datta, Biswa N. Sequential and Parallel Matrix Computations. Fort Belvoir, VA: Defense Technical Information Center, March 1985. http://dx.doi.org/10.21236/ada167185.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Schnabel, Robert B. Sequential and Parallel Methods for Unconstrained Optimization. Fort Belvoir, VA: Defense Technical Information Center, October 1988. http://dx.doi.org/10.21236/ada203807.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Smith, Sharon, Elizabeth Eskow, and Robert B. Schnabel. Adaptive, Asynchronous Stochastic Global Optimization Algorithms for Sequential and Parallel Computation. Fort Belvoir, VA: Defense Technical Information Center, October 1989. http://dx.doi.org/10.21236/ada217093.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Taylor, A. G. ,. LLNL. User documentation for KINSOL, a nonlinear solver for sequential and parallel computers. Office of Scientific and Technical Information (OSTI), July 1998. http://dx.doi.org/10.2172/314885.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Ulis, Bradley J. Iris Recognition Using Parallel and Sequential Logic in a Reconfigurable Logic Device. Fort Belvoir, VA: Defense Technical Information Center, May 2009. http://dx.doi.org/10.21236/ada549044.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Torczon, Virginia. PDS: Direct Search Methods for Unconstrained Optimization on Either Sequential or Parallel Machines. Fort Belvoir, VA: Defense Technical Information Center, March 1992. http://dx.doi.org/10.21236/ada455473.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Hisley, Dixie, and Duane Frist. Performance of a Sequential and Parallel Computational Fluid Dynamic (CFD) Solver on a Missile Body Configuration. Fort Belvoir, VA: Defense Technical Information Center, August 1999. http://dx.doi.org/10.21236/ada368182.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Amela, R., R. Badia, S. Böhm, R. Tosi, C. Soriano, and R. Rossi. D4.2 Profiling report of the partner’s tools, complete with performance suggestions. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.023.

Повний текст джерела
Анотація:
This deliverable focuses on the proling activities developed in the project with the partner's applications. To perform this proling activities, a couple of benchmarks were dened in collaboration with WP5. The rst benchmark is an embarrassingly parallel benchmark that performs a read and then multiple writes of the same object, with the objective of stressing the memory and storage systems and evaluate the overhead when these reads and writes are performed in parallel. A second benchmark is dened based on the Continuation Multi Level Monte Carlo (C-MLMC) algorithm. While this algorithm is normally executed using multiple levels, for the proling and performance analysis objectives, the execution of a single level was enough since the forthcoming levels have similar performance characteristics. Additionally, while the simulation tasks can be executed as parallel (multi-threaded tasks), in the benchmark, single threaded tasks were executed to increase the number of simulations to be scheduled and stress the scheduling engines. A set of experiments based on these two benchmarks have been executed in the MareNostrum 4 supercomputer and using PyCOMPSs as underlying programming model and dynamic scheduler of the tasks involved in the executions. While the rst benchmark was executed several times in a single iteration, the second benchmark was executed in an iterative manner, with cycles of 1) Execution and trace generation; 2) Performance analysis; 3) Improvements. This had enabled to perform several improvements in the benchmark and in the scheduler of PyCOMPSs. The initial iterations focused on the C-MLMC structure itself, performing re-factors of the code to remove ne grain and sequential tasks and merging them in larger granularity tasks. The next iterations focused on improving the PyCOMPSs scheduler, removing existent bottlenecks and increasing its performance by making the scheduler a multithreaded engine. While the results can still be improved, we are satised with the results since the granularity of the simulations run in this evaluation step are much ner than the one that will be used for the real scenarios. The deliverable nishes with some recommendations that should be followed along the project in order to obtain good performance in the execution of the project codes.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Kerr, D. E. Reconnaissance surficial geology, Clarke River, Northwest Territories, NTS 65-M north. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/329416.

Повний текст джерела
Анотація:
The Clarke River map area (north half) comprises isolated areas of glacially and meltwater scoured bedrock, till veneers and blankets, locally fluted, and strongly fluted (mega-scale glacial lineations) streamlined till in the northeast. Ridged till may overlie fluted till blanket and streamlined till. Glaciofluvial esker complexes and associated meltwater outwash sediments trend westward (some may parallel pre-glacial valleys), southwestward, and northwestward. Glaciolacustrine sediments are a minor component. An early regional warm-based diverging southwestern and southern ice flow is well preserved in the central regions across the map area. The youngest late deglacial ice flows, in the extreme southwest and broader northeast region, are both northwesterly. The latter represents the Dubawnt Lake ice stream. During ice retreat, ridged till was deposited with minor moraines and larger recessional moraines locally. Ponding meltwater formed pro-glacial lakes with deltas, beaches, and trim lines from 355 m elevation, in the southwest, to 155 m, in the northeast.
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Parallel and sequential regions" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії