Se connecter

Bibliographies thématiques / Parallel processing (Electronic computers) / Thèses

Thèses sur le sujet « Parallel processing (Electronic computers) »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Parallel processing (Electronic computers).

Auteur : Grafiati

Publié le 4 juin 2021

Mis à jour le 6 septembre 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Parallel processing (Electronic computers) ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.

1

Jin, Xiaoming. « A practical realization of parallel disks for a distributed parallel computing system ». [Gainesville, Fla.] : University of Florida, 2000. http://etd.fcla.edu/etd/uf/2000/ane5954/master.PDF.

Texte intégral

Résumé :

Thesis (M.S.)--University of Florida, 2000.
Title from first page of PDF file. Document formatted into pages; contains ix, 41 p.; also contains graphics. Vita. Includes bibliographical references (p. 39-40).

Styles APA, Harvard, Vancouver, ISO, etc.

2

練偉森 et Wai-sum Lin. « Adaptive parallel rendering ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31221415.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Lin, Wai-sum. « Adaptive parallel rendering / ». Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20868236.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Harrison, Ian. « Locality and parallel optimizations for parallel supercomputing ». Diss., Connect to the thesis, 2003. http://hdl.handle.net/10066/1274.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Hybinette, Maria. « Interactive parallel simulation environments ». Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/9174.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Baker, James McCall Jr. « Run-time systems for fine-grain message-passing parallel computers ». Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/15366.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Zhang, Hua 1954. « Practical Parallel Processing ». Thesis, University of North Texas, 1996. https://digital.library.unt.edu/ark:/67531/metadc278769/.

Texte intégral

Résumé :

The physical limitations of uniprocessors and the real-time requirements of numerous practical applications have made parallel processing an essential technology in military, industry and scientific research. In this dissertation, we investigate parallelizations of three practical applications using three parallel machine models. The algorithms are: Finitely inductive (FI) sequence processing is a pattern recognition technique used in many fields. We first propose four parallel FI algorithms on the EREW PRAM. The time complexity of the parallel factoring and following by bucket packing is O(sk^2 n/p), and they are optimal under some conditions. The parallel factoring and following by hashing requires O(sk^2 n/p) time when uniform hash functions are used and log(p) ≤ k n/p and pm ≈ n. Their speedup is proportional to the number processors used. For these results, s is the number of levels, k is the size of the antecedents and n is the length of the input sequence and p is the number of processors. We also describe algorithms for raster/vector conversion based on the scan model to handle block-like connected components of arbitrary geometrical shapes with multi-level nested dough nuts for the IES (image exploitation system). Both the parallel raster-to-vector algorithm and parallel vector-to-raster algorithm require O(log(n2)) or O(log2(n2)) time (depending on the sorting algorithms used) for images of size n2 using p = n2 processors. Not only is the DWT (discrete wavelet transforms) useful in data compression, but also has it potentials in signal processing, image processing, and graphics. Therefore, it is of great importance to investigate efficient parallelizations of the wavelet transforms. The time complexity of the parallel forward DWT on the parallel virtual machine with linear processor organization is O(((so+s1)mn)/p), where s0 and s1 are the lengths of the filters and p is the number of processors used. The time complexity of the inverse DWT is also O(((so+s1)mn)/p). If the processors are organized as a 2D array with PrawPcol processors, both the interleaved parallel DWT and IDWT have the time complexity of O(((so+s1)mn)/ProwPcol). We have parallelized three applications and achieved optimality or best-possible performances for each of the three applications over each of the chosen machine models. Future research will involve continued examination of parallel architectures for implementation of practical problems.

Styles APA, Harvard, Vancouver, ISO, etc.

8

Nader, Babak. « Parallel solution of sparse linear systems ». Full text open access at:, 1987. http://content.ohsu.edu/u?/etd,138.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Romig, Phillip R. « Parallel task processing of very large datasets ». [Lincoln, Neb. : University of Nebraska-Lincoln], 1999. http://international.unl.edu/Private/1999/romigab.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Elabed, Jamal. « Implementing parallel sorting algorithms ». Virtual Press, 1989. http://liblink.bsu.edu/uhtbin/catkey/543997.

Texte intégral

Résumé :

The Republic of Guinea is located on the west coast of Africa at about 11° North latitude. A large portion of Guinea's supply of protein is dried fish. The actual drying method operates under open air, the foodstuff being unprotected from unexpected rains, windborne dirt and dust, and from infestation by insects, rodents, and other animals. More, the deforestation rate is increasing year after year, depleting the source of fuel for drying. Practical ways of drying fish cheaply and sanitarily would be welcome.Recently, much work has been devoted to developing algorithms for parallel processors. Parallel algorithms have received a great deal of attention because of the advances in computer hardware technology. These parallel processors and algorithms have been used to improve computational speed, especially in the areas of sorting, evaluation of polynomials, arithmetic expressions, matrix and graphic problems.Sorting is an important operation in business and computer engineering applications. The literature contains many sorting algorithms, both sequential and parallel, which have been developed and used in practical applications. bubble sort, quick sort, insertion sort, enumeration sort, bucket and odd-even transposition sort. Ada, a new excellent programming language that offers high-level concurrent processing facilities called tasks, is used in this thesis to introduce, implement, compare and evaluate some of the parallel sorting algorithms. This thesis will also show that parallel sorting algorithms reduce the time requirement to perform the tasks.
Department of Computer Science

Styles APA, Harvard, Vancouver, ISO, etc.

11

Cheung, Steven. « Packet routing on mesh-connected computers / ». [Hong Kong] : University of Hong Kong, 1992. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13209607.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

12

Katiker, Rushikesh. « Automatic generation of dynamic parallel architectures ». Click here for download, 2007. http://proquest.umi.com/pqdweb?did=1475182071&sid=1&Fmt=2&clientId=3260&RQT=309&VName=PQD.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

13

張治昌 et Steven Cheung. « Packet routing on mesh-connected computers ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1992. http://hub.hku.hk/bib/B3121020X.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

14

Davis, Martin H. Jr. « Optical waveguides in general purpose parallel computers ». Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/8153.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

15

Chen, Liang. « Performance analysis and improvement of parallel simulation ». Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/25477.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

16

Rehfuss, Paul Stephen. « Parallelism in contextual processing / ». Full text open access at:, 1999. http://content.ohsu.edu/u?/etd,272.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

17

Das, Samir Ranjan. « Performance issues in time warp parallel simulations ». Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/8152.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

18

邱祖淇 et Cho-ki Joe Yau. « Efficient solutions for the load distribution problem ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31222031.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

19

Yau, Cho-ki Joe. « Efficient solutions for the load distribution problem / ». Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20971953.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

20

Wai, Siu-kit, et 衛兆傑. « Virtual links for multicomputers ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B18038050.

Texte intégral

Résumé :

(Uncorrected OCR) Abstract of Thesis entitled 'Virtual Links for Multicomputers' Submitted by Siu Kit Wai for the degree of Master of Philosophy at Univsersity of Hong Kong in October 1996 In order to increase computation power, multiple autonomous computers or processors are connected to form a multicomputer. The performance boost is the result of exploiting in parallel the processing power available in individual processors. Parallel processing, however, requires the cooperation among the processors, which implies interprocessor communication. The efficiency of such communications is limited by the bandwidth and number of communication channels between directly connected processors. Multiple processes on a processor share a few hardware communication links/channels to communication with processes executing on a different processor. Effective and efficient sharing of channels is important for the overall system performance; hence it is important that the sharing be properly managed. When the sharing is not provided by the hardware, it can be provided in software at system level. Without a managing component, processes need to be programmed to flight for and gain exclusive access to the communication links. This is usually not effective, error-prone, and could reduce the overall performance of processes executing in the processor. Flexibility is a main advantage of providing a channel-sharing mechanism at system level. Parameters such as packet size, and configuration of the system can be customized and tuned to meet the communication characteristics of different applications. In this project, we investigate how link sharing can be provided at system level. Our approach is based on idea of virtual links. The system is designed to be as transparent and easy to be used as possible. We will discuss how different parameters and configurations affect the system functionality and performance. We also compare this software solution to other existing solutions including a hardware solution. ii
abstract
toc
Computer Science
Master
Master of Philosophy

Styles APA, Harvard, Vancouver, ISO, etc.

21

Wai, Siu-kit. « Virtual links for multicomputers / ». Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B18038050.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

22

Simard, Carole. « Relational algebra on a parallel-sort database machine ». Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63225.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

23

Chiang, K. (Kuoning). « Parallel processing approach for crash dynamic analysis ». Diss., Georgia Institute of Technology, 1989. http://hdl.handle.net/1853/17917.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

24

Cline, George E. « A control framework for distributed (parallel) processing environments ». Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-12042009-020227/.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

25

Sivasubramaniam, Anand. « A framework for evaluating architectural issues of parallel systems ». Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/9194.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

26

Garg, Vivek. « Mechanisms for hiding communication latency in data parallel architecture ». Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/15609.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

27

Lee, Sae Hun. « A unified approach to optimal multiprocessor implementations from non-parallel algorithm specifications ». Diss., Georgia Institute of Technology, 1986. http://hdl.handle.net/1853/16745.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

28

Zuriekat, Faris Nabeeh. « Parallel remote interactive management model ». CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3222.

Texte intégral

Résumé :

This thesis discusses PRIMM which stands for Parallel Remote Interactive Management Model. PRIMM is a framework for object oriented applications that relies on grid computing. It works as an interface between the remote applications and the parallel computing system. The thesis shows the capabilities that could be achieved from PRIMM architecture.

Styles APA, Harvard, Vancouver, ISO, etc.

29

Hopper, Michael A. « A compiler framework for multithreaded parallel systems ». Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/15638.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

30

Murphy, Ciaron William. « Run time reconfigurable DSP parallel processing system using dynamic FPGAs ». Thesis, Liverpool John Moores University, 2002. http://researchonline.ljmu.ac.uk/4924/.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

31

Pan, Yinfei. « Parallel XML parsing ». Diss., Online access via UMI:, 2009.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

32

Kilpatrick, Carol Elizabeth. « Capture and display of performanced information for parallel and distributed applications ». Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/8193.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

33

Larrabee, Alan Roger. « Adaptation of a large-scale computational chemistry program to the iPSC concurrent computer ». Full text open access at:, 1986. http://content.ohsu.edu/u?/etd,116.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

34

Haggard, Roger Lynn. « A design methodology for optimal parallel coupled cyclic computing ». Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/15919.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

35

Liang, Wen. « A compiler optimization framework for Concordia Parallel C ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ39488.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

36

Huang, Chun-Hsi. « Communication-efficient bulk synchronous parallel algorithms ». Buffalo, N.Y. : Dept. of Computer Science, State University of New York at Buffalo, 2001. http://www.cse.buffalo.edu/tech%2Dreports/2001%2D06.ps.Z.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

37

Choi, Jong-Deok. « Parallel program debugging with flowback analysis ». Madison, Wis. : University of Wisconsin-Madison, Computer Sciences Dept, 1989. http://catalog.hathitrust.org/api/volumes/oclc/20839575.html.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

38

Jeong, Byeong-Soo. « Indexing in parallel database systems ». Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/8189.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

39

Foster, Mark H. « Design of a list-structure memory using parallel garbage collection / ». Full text open access at:, 1985. http://content.ohsu.edu/u?/etd,88.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

40

Bhalerao, Rohit Dinesh. « Parallel XML parsing ». Diss., Online access via UMI:, 2007.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

41

Lyu, Chung-nan. « Pipelined floating point divider with built-in testing circuits ». Ohio : Ohio University, 1988. http://www.ohiolink.edu/etd/view.cgi?ohiou1182864748.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

42

Peyravi, Mohammad Hassan. « Study of interconnection networks / ». Full-text version available from OU Domain via ProQuest Digital Dissertations, 1985.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

43

Wong, Kwan-po. « High-speed network interface for commodity SMP clusters ». Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B22505520.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

44

Park, Hee Yong. « Peer List Update Manager (PLUM) implementation in Open Computing Exchanging and Arbitration Network (OCEAN) ». [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1000151.

Texte intégral

Résumé :

Thesis (M.S.)--University of Florida, 2002.
Title from title page of source document. Document formatted into pages; contains ix, 44 p.; also contains graphics. Includes vita. Includes bibliographical references.

Styles APA, Harvard, Vancouver, ISO, etc.

45

Velusamy, Vijay. « Adapting Remote Direct Memory Access based file system to parallel Input-/Output ». Master's thesis, Mississippi State : Mississippi State University, 2003. http://library.msstate.edu/etd/show.asp?etd=etd-11112003-092209.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

46

Robinson, Patrick Glen. « Distributed Linda : design, development, and characterization of the data subsystem / ». Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-07102009-040417/.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

47

Chin, Douglas Andrew. « Complexity issues in general purpose parallel computing ». Thesis, University of Oxford, 1991. http://ora.ox.ac.uk/objects/uuid:b16a89c9-c44e-48cd-b120-9ed755ac7848.

Texte intégral

Résumé :

In recent years, powerful theoretical techniques have been developed for supporting communication, synchronization and fault tolerance in general purpose parallel computing. The proposition of this thesis is that different techniques should be used to support different algorithms. The determining factor is granularity, or the extent to which an algorithm uses long blocks for communication between processors. We consider the Block PRAM model of Aggarwal, Chandra and Snir, a synchronous model of parallel computation in which the processors commu- nicate by accessing a shared memory. In the Block PRAM model, there is a time cost for each access by a processor to a block of locations in the shared memory. This feature of the model encourages the use of long blocks for communication. In the thesis we present Block PRAM algorithms and lower bounds for specific problems on arrays, lists, expression trees, graphs, strings, binary trees and butterflies. These results introduce useful basic techniques for parallel computation in practice, and provide a classification of problems and algorithms according to their granularity. Also presented are optimal algorithms for universal hashing and skewing, which are techniques for sup- porting conflict-free memory access in general- and special-purpose parallel computations, respectively. We explore the Block PRAM model as a theoretical basis for the design of scalable general purpose parallel computers. Several simulation results are presented which show the Block PRAM model to be comparable to, and competitive with, other models that have been proposed for this role. Two major advantages of machines based on the Block PRAM model is that they are able to preserve the granularity properties of individual algorithms and can efficiently incorporate a significant degree of fault tolerance. The thesis also discusses methods for the design of algorithms that do not use synchronization. We apply these methods to define fast circuits for several fundamental Boolean functions.

Styles APA, Harvard, Vancouver, ISO, etc.

48

Gu, Weiming. « On-line monitoring and interactive steering of large-scale parallel and distributed applications ». Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/9220.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

49

Hasan, Waqar. « Optimization of SQL queries for parallel machines / ». Berlin [u.a.] : Springer, 1996. http://www.loc.gov/catdir/enhancements/fy0815/96039704-d.html.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

50

Ikei, Mitsuru. « Automatic program restructuring for distributed memory multicomputers ». Full text open access at:, 1992. http://content.ohsu.edu/u?/etd,191.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!