Relevant bibliographies by topics / Electronic data processing – Distributed processing / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Electronic data processing – Distributed processing.

Dissertations / Theses on the topic 'Electronic data processing – Distributed processing'

Author: Grafiati
Published: 4 June 2021
Last updated: 29 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Electronic data processing – Distributed processing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Gottemukkala, Vibby. "Scalability issues in distributed and parallel databases." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/8176.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bodorik, Peter Carleton University Dissertation Engineering Electrical. "Query processing strategies in a distributed data base." Ottawa, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ravindran, K. "Reliable client-server communication in distributed programs." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/27514.

Full text
Abstract:
Remote procedure call (RPC) and shared variable are communication abstractions which allow the various processes of a distributed program, often modelled as clients and servers, to communicate with one another across machine boundaries. A key requirement of the abstractions is to mask the machine and communication failures that may occur during the client-server communications. In practice, many distributed applications can inherently tolerate failures under certain situations. If such application layer information is available to the client-server communication layer (RPC and shared variable), the failure masking algorithms in the communication layer may relax the constraints under which the algorithms may have to operate if the information is not available. The relaxation significantly simplifies the algorithms and the underlying message transport layer and allows formulation of efficient algorithms. This application-driven approach forms the backbone of the failure masking techniques described in the thesis, as outlined below: Orphan handling in RPCs: Using the application-driven approach, the thesis introduces a new technique of adopting the orphans caused by failures during RPCs. The adoption technique is preferable to orphan killing because orphan killing wastes any work already completed and requires rollback which may be expensive and sometimes not meaningful. The thesis incorporates orphan adoption into two schemes of replicating a server: i) Primary-secondary scheme in which one of the replicas of the server acts as the primary and executes RPCs from clients while the other replicas stand by as secondaries. When the primary fails, one of the secondaries becomes the primary, restarts the server execution from the most recent checkpoint and adopts the orphan, ii) Replicated execution scheme in which an RPC on the server is executed by more than one replica of the server. When any of the replicas fails, the orphan generated by the failure is adopted by the surviving replicas. Both schemes employ call re-executions by servers based on the application-level idempotency properties of the calls. Access to shared variables: Contemporary distributed programs deal with a new class of shared variables such as information on name bindings, distributed load and leadership within a service group. Since the consistency constraints on such system variables need not be as strong as those for user data, the access operations on the variables may be made simpler using this application layer information. Along this direction, the thesis introduces an abstraction, which we call application-driven shared variable, to govern access operations on the variables. The algorithms for the access operations on a variable use intra-server group communication and enforce consistency of the variable to the extent required by the application. The thesis describes complete communication models incorporating the application-driven approach to mask failures.
Science, Faculty of
Computer Science, Department of
Graduate
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Setiowijoso, Liono. "Data Allocation for Distributed Programs." PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/5102.

Full text
Abstract:
This thesis shows that both data and code must be efficiently distributed to achieve good performance in a distributed system. Most previous research has either tried to distribute code structures to improve parallelism or to distribute data to reduce communication costs. Code distribution (exploiting functional parallelism) is an effort to distribute or to duplicate function codes to optimize parallel performance. On the other hand, data distribution tries to place data structures as close as possible to the function codes that use it, so that communication cost can be reduced. In particular, dataflow researchers have primarily focused on code partitioning and assignment. We have adapted existing data allocation algorithms for use with an existing dataflow-based system, ParPlum. ParPlum allows the execution of dataflow graphs on networks of workstations. To evaluate the impact of data allocation, we extended ParPlum to more effectively handle data structures. We then implemented tools to extract from dataflow graphs information that is relevant to the mapping algorithms and fed this information to our version of a data distribution algorithm. To see the relation between code and data parallelism we added optimization to optimize the distribution of the loop function components and the data structure access components. All of these are done automatically without programmer or user involvement. We ran a number of experiments using matrix multiplication as our workload. We used different numbers of processors and different existing partitioning and allocation algorithm. Our results show that automatic data distribution greatly improves the performance of distributed dataflow applications. For example, with 15 x 15 matrices, applying data distribution speeds up execution about 80% on 7 machines. Using data distribution and our code-optimizations on 7 machines speeds up execution over the base case by 800%. Our work shows that it is possible to make efficient use of distributed networks with compiler support and shows that both code mapping and data mapping must be considered to achieve optimal performance.
APA, Harvard, Vancouver, ISO, and other styles
7

Bernabéu-Aubán, José Manuel. "Location finding algorithms for distributed systems." Diss., Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/32951.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Navaratnam, Srivallipuranandan. "Reliable group communication in distributed systems." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26505.

Full text
Abstract:
This work describes the design and implementation details of a reliable group communication mechanism. The mechanism guarantees that messages will be received by all the operational members of the group or by none of them (atomicity). In addition, the sequence of messages will be the same at each of the recipients (order). The message ordering property can be used to simplify distributed database systems and distributed processing algorithms. The proposed mechanism continues to operate despite process, host and communication link failures (survivability). Survivability is essential in fault-tolerant applications.
Science, Faculty of
Computer Science, Department of
Graduate
APA, Harvard, Vancouver, ISO, and other styles
9

Torres-Rojas, Francisco Jose. "Scalable approximations to causality and consistency of distributed objects." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/9155.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Algire, Martin. "Distributed multi-processing for high performance computing." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=31180.

Full text
Abstract:
Parallel computing can take many forms. From a user's perspective, it is important to consider the advantages and disadvantages of each methodology. The following project attempts to provide some perspective on the methods of parallel computing and indicate where the tradeoffs lie along the continuum. Problems that are parallelizable enable researchers to maximize the computing resources available for a problem, and thus push the limits of the problems that can be solved. Solving any particular problem in parallel will require some very important design decisions to be made. These decisions may dramatically affect portability, performance, and cost of implementing a software solution to the problem. The results gained from this work indicate that although performance improvements are indeed possible---they are heavily dependent on the application in question and may require much more programming effort and expertise to implement.
APA, Harvard, Vancouver, ISO, and other styles
11

陳敏兒 and Mee-yee Chan. "Efficient and resilient distributed algorithms for comparisonproblems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1987. http://hub.hku.hk/bib/B31231093.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Liu, Guangtian. "An event service architecture in distributed real-time systems /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Pitts, David Vernon. "A storage management system for a reliable distributed operating system." Diss., Georgia Institute of Technology, 1986. http://hdl.handle.net/1853/16895.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Drougas, Ioannis. "Rate allocation in distributed stream processing systems." Diss., [Riverside, Calif.] : University of California, Riverside, 2008. http://proquest.umi.com/pqdweb?index=0&did=1663077971&SrchMode=2&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1268240766&clientId=48051.

Full text
Abstract:
Thesis (Ph. D.)--University of California, Riverside, 2008.
Includes abstract. Title from first page of PDF file (viewed March 10, 2010). Available via ProQuest Digital Dissertations. Includes bibliographical references (p. 93-98). Also issued in print.
APA, Harvard, Vancouver, ISO, and other styles
17

孫昱東 and Yudong Sun. "A distributed object model for solving irregularly structured problemson distributed systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B31243630.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Zhou, Dong. "JECho - An efficient, customizable, adaptive distributed event system." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/9180.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

田慶豐 and Hing-fung Ting. "Examples of time-message tradeoffs in distributed algorithms." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1988. http://hub.hku.hk/bib/B31208393.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Herrmann, Amy Elizabeth. "Coupled design decisions in distributed design." Thesis, Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/16656.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Pu, Calton. "Replication and nested transactions in the Eden Distributed System /." Thesis, Connect to this title online; UW restricted, 1986. http://hdl.handle.net/1773/6881.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

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.

Full text
Abstract:
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, and other styles
23

Elmagarmid, Ahmed Khalifa. "Deadlock detection and resolution in distributed processing systems /." The Ohio State University, 1985. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487261919110166.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Norcross, Stuart John. "Deriving distributed garbage collectors from distributed termination algorithms." Thesis, University of St Andrews, 2004. http://hdl.handle.net/10023/14986.

Full text
Abstract:
This thesis concentrates on the derivation of a modularised version of the DMOS distributed garbage collection algorithm and the implementation of this algorithm in a distributed computational environment. DMOS appears to exhibit a unique combination of attractive characteristics for a distributed garbage collector but the original algorithm is known to contain a bug and, previous to this work, lacks a satisfactory, understandable implementation. The relationship between distributed termination detection algorithms and distributed garbage collectors is central to this thesis. A modularised DMOS algorithm is developed using a previously published distributed garbage collector derivation methodology that centres on mapping centralised collection schemes to distributed termination detection algorithms. In examining the utility and suitability of the derivation methodology, a family of six distributed collectors is developed and an extension to the methodology is presented. The research work described in this thesis incorporates the definition and implementation of a distributed computational environment based on the ProcessBase language and a generic definition of a previously unimplemented distributed termination detection algorithm called Task Balancing. The role of distributed termination detection in the DMOS collection mechanisms is defined through a process of step-wise refinement. The implementation of the collector is achieved in two stages; the first stage defines the implementation of two distributed termination mappings with the Task Balancing algorithm; the second stage defines the DMOS collection mechanisms.
APA, Harvard, Vancouver, ISO, and other styles
26

Gunaseelan, L. "Debugging of Distributed object systems." Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/9219.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Haddix, Frank Furman. "Alternating parallelism and the stabilization of distributed systems /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Nguyen, Thuyen Dinh 1959. "A CASE STUDY OF FLEXIBLE DISTRIBUTED PROCESSING SYSTEM IN COPIER DEVELOPMENT (PROPOTYPE, DRIVER, PROTOCOL)." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/275518.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Sun, Yudong. "A distributed object model for solving irregularly structured problems on distributed systems /." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B23501662.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Jacob, Aju. "Distributed configuration management for reconfigurable cluster computing." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0007181.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Menon, Sathis N. "Asynchronous events : tools for distributed programming on concurrent object-based systems." Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/9147.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Mantoro, Teddy. "Distributed support for intelligent environments /." View thesis entry in Australian Digital Theses Program, 2006. http://thesis.anu.edu.au/public/adt-ANU20070123.150814/index.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Chan, Mee-yee. "Efficient and resilient distributed algorithms for comparison problems /." [Hong Kong : University of Hong Kong], 1987. http://sunzi.lib.hku.hk/hkuto/record.jsp?B12344886.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Ting, Hing-fung. "Examples of time-message tradeoffs in distributed algorithms /." [Hong Kong : University of Hong Kong], 1988. http://sunzi.lib.hku.hk/hkuto/record.jsp?B1234980X.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Karlapalem, Kamalakar. "Redesign of distributed relational databases." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/9173.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Khalidi, M. Yousef Amin. "Hardware support for distributed object-based systems." Diss., Georgia Institute of Technology, 1989. http://hdl.handle.net/1853/8192.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

張立新 and Lap-sun Cheung. "Load balancing in distributed object computing systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B31224179.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Woon, Thean Hung Wilson, and 云天恒. "Effective distributed broadcasting protocols for wireless networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B45880190.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Rodriguez, Wilfredo. "Identifying mechanisms (naming) in distributed systems : goals, implications and overall influence on performance /." Online version of thesis, 1985. http://hdl.handle.net/1850/8820.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Famorzadeh, Shahram. "BEEHIVE : an adaptive, distributed, embedded signal processing environment." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/14803.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

潘淑欣 and Shuk-yan Poon. "A decentralized multi-agent system for restructured power system operation." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31219810.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Jeon, Dae Kyung. "Methodologies for developing distributed systems in Ada with a simulation of a distributed Ada system." Virtual Press, 1989. http://liblink.bsu.edu/uhtbin/catkey/722459.

Full text
Abstract:
In recent years, the field of distributed processing, distributed systems, has undergone great change, and has been an area attracting tremendous research and development efforts. This thesis explores the various current methodologies for designing, developing and implementing distributed systems using the Ada programming language, and goes on to implement a simulation of a distributed store system using the "virtual node" design approach. After a brief introduction on distributed systems in general, an investigation of the basic issues and problems involved in distributing Ada programs coupled with an analysis and comparison of various approaches to developing distributed Ada systems is carried out. It is shown that one of the critical problems of Ada in a distributed environment is its implicit assumption of a single memory processor. A simulation of a distributed system (store system) is carried out using the virtual node method of developing distributed Ada systems. The various stages of this design method including interface task specification are stepped through. A sample run of the. system is given, including the customer file, stock file data and the monitored output of the system.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
44

Cuce, Simon. "GLOMAR : a component based framework for maintaining consistency of data objects within a heterogeneous distributed file system." Monash University, School of Computer Science and Software Engineering, 2003. http://arrow.monash.edu.au/hdl/1959.1/5743.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Chiu, Lin. "A methodology for designing concurrency control schemes in distributed databases /." The Ohio State University, 1987. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487584612163117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Pawar, Madhurima. "Routing algorithm for distributed Web documents." [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp1304/MASTER1.pdf.

Full text
Abstract:
Thesis (M.S.)--University of Florida, 2001.
Title from first page of PDF file. Document formatted into pages; contains x, 52 p.; also contains graphics. Vita. Includes bibliographical references (p. 49-51).
APA, Harvard, Vancouver, ISO, and other styles
47

Bennett, John K. "Distributed Smalltalk : inheritance and reactiveness in distributed systems /." Thesis, Connect to this title online; UW restricted, 1988. http://hdl.handle.net/1773/6923.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Yi, Byungho. "Faults and fault-tolerance in distributed computing systems : the election problem." Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/8312.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Lin, Luke. "Localizing the effects of failure in distributed systems." Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/8207.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Rixner, Lois R. "A survey and analysis of algorithms for the detection of termination in a distributed systems /." Online version of thesis, 1991. http://hdl.handle.net/1850/11008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Electronic data processing – Distributed processing' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography