Einloggen

Thematische Bibliographien / Parallel processing (Electronic computers) / Dissertationen

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Parallel processing (Electronic computers).

Dissertationen zum Thema „Parallel processing (Electronic computers)“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 31. Juli 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Parallel processing (Electronic computers)" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

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.

Der volle Inhalt der Quelle

Annotation:

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).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

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

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

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

Der volle Inhalt der Quelle

Annotation:

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

邱祖淇 und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

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

Der volle Inhalt der Quelle

Annotation:

(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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

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

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Pan, Yinfei. „Parallel XML parsing“. Diss., Online access via UMI:, 2009.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Bhalerao, Rohit Dinesh. „Parallel XML parsing“. Diss., Online access via UMI:, 2007.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

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.

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

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/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!