Einloggen

Thematische Bibliographien / Electronic data processing / Dissertationen

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

Dissertationen zum Thema „Electronic data processing“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 30. 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 "Electronic data processing" 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

Ostroumov, Ivan Victorovich. „Magnetic field data processing with personal electronic device“. Thesis, Polit. Challenges of science today: International Scientific and Practical Conference of Young Researchers and Students, April 6–8, 2016 : theses. – К., 2016. – 83p, 2016. http://er.nau.edu.ua/handle/NAU/26649.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

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

3

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

4

Parker, Greg. „Robust processing of diffusion weighted image data“. Thesis, Cardiff University, 2014. http://orca.cf.ac.uk/61622/.

Der volle Inhalt der Quelle

Annotation:

The work presented in this thesis comprises a proposed robust diffusion weighted magnetic resonance imaging (DW-MRI) pipeline, each chapter detailing a step designed to ultimately transform raw DW-MRI data into segmented bundles of coherent fibre ready for more complex analysis or manipulation. In addition to this pipeline we will also demonstrate, where appropriate, ways in which each step could be optimized for the maxillofacial region, setting the groundwork for a wider maxillofacial modelling project intended to aid surgical planning. Our contribution begins with RESDORE, an algorithm designed to automatically identify corrupt DW-MRI signal elements. While slower than the closest alternative, RESDORE is also far more robust to localised changes in SNR and pervasive image corruptions. The second step in the pipeline concerns the retrieval of accurate fibre orientation distribution functions (fODFs) from the DW-MRI signal. Chapter 4 comprises a simulation study exploring the application of spherical deconvolution methods to `generic' fibre; finding that the commonly used constrained spherical harmonic deconvolution (CSHD) is extremely sensitive to calibration but, if handled correctly, might be able to resolve muscle fODFs in vivo. Building upon this information, Chapter 5 conducts further simulations and in vivo image experimentation demonstrating that this is indeed the case, allowing us to demonstrate, for the first time, anatomically plausible reconstructions of several maxillofacial muscles. To complete the proposed pipeline, Chapter 6 then introduces a method for segmenting whole volume streamline tractographies into anatomically valid bundles. In addition to providing an accurate segmentation, this shape-based method does not require computationally expensive inter-streamline comparisons employed by other approaches, allowing the algorithm to scale linearly with respect to the number of streamlines within the dataset. This is not often true for comparison based methods which in the best case scale in higher linear time but more often by O(N2) complexity.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Snowdon, Jane Louise. „Workflow control for surges from a batch work station“. Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/25100.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Lee, J. J. „The object-oriented database and processing of electronic warfare data“. Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1996. http://handle.dtic.mil/100.2/ADA303112.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Tucker, Peter A. „Punctuated data streams /“. Full text open access at:, 2005. http://content.ohsu.edu/u?/etd,255.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Lewis, Tony. „Electronic data interchange in the construction industry“. Thesis, Loughborough University, 1998. https://dspace.lboro.ac.uk/2134/11183.

Der volle Inhalt der Quelle

Annotation:

The aim of this research is to improve the efficiency of the construction process through the application of electronic data interchange (EDI). This thesis describes the development and application of EDI messages. The messages described are targeted to provide a means for transferring construction specific information during the construction process. The definition of electronic data interchange and its technical issues are first described. The nature of EDI, replacing paper based communication with electronic messages, impacts on the way in which business is conducted, and also has far reaching legal implications due to the reliance of many legal systems on paper documents and signatures. The business and legal implications are therefore discussed in detail. The application of EDI in the construction industry is investigated by means of a literature review. This work is furthered by a longitudinal study of the construction industry's application of EDI, which consisted of two surveys at a five year interval. A model of the information flows within the traditional construction process is developed to assist in the identification of information flows suitable for EDI. A methodology for message development was produced. The methodology was then applied to develop a description data model that could be utilised in the existing bill of quantity and trading cycle messages. The bill of quantity message set was at a stage ready for trial. To determine the issues related to implementation specifically in the construction industry a trial implementation of this message set was undertaken. The official implementation undertaken by EDICON is described. Software was also developed to undertake the trial. This software was tested and proved the message set developed was suitable for the transfer of bill of quantity related information during a construction project. The factors causing the failure of the implementation of the bill of quantities message set are discussed. A number of these factors are considered valid for all construction project information flows. Finally, the use of shared project models to re-engineer construction information tasks is recommended as a means of achieving significant benefit from electronic data exchange in the construction process.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

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

13

Chen, George C. M. „Strategic analysis of a data processing company /“. Burnaby B.C. : Simon Fraser University, 2005. http://ir.lib.sfu.ca/handle/1892/3624.

Der volle Inhalt der Quelle

Annotation:

Research Project (M.B.A.) - Simon Fraser University, 2005.
Research Project (Faculty of Business Administration) / Simon Fraser University. Senior supervisor : Dr. Ed Bukszar. EMBA Program. Also issued in digital format and available on the World Wide Web.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Bostanudin, Nurul Jihan Farhah. „Computational methods for processing ground penetrating radar data“. Thesis, University of Portsmouth, 2013. https://researchportal.port.ac.uk/portal/en/theses/computational-methods-for-processing-ground-penetrating-radar-data(d519f94f-04eb-42af-a504-a4c4275d51ae).html.

Der volle Inhalt der Quelle

Annotation:

The aim of this work was to investigate signal processing and analysis techniques for Ground Penetrating Radar (GPR) and its use in civil engineering and construction industry. GPR is the general term applied to techniques which employ radio waves, typically in the Mega Hertz and Giga Hertz range, to map structures and features buried in the ground or in manmade structures. GPR measurements can suffer from large amount of noise. This is primarily caused by interference from other radio-wave-emitting devices (e.g., cell phones, radios, etc.) that are present in the surrounding area of the GPR system during data collection. In addition to noise, presence of clutter – reflections from other non-target objects buried underground in the vicinity of the target can make GPR measurement difficult to understand and interpret, even for the skilled human, GPR analysts. This thesis is concerned with the improvements and processes that can be applied to GPR data in order to enhance target detection and characterisation process particularly with multivariate signal processing techniques. Those primarily include Principal Component Analysis (PCA) and Independent Component Analysis (ICA). Both techniques have been investigated, implemented and compared regarding their abilities to separate the target originating signals from the noise and clutter type signals present in the data. Combination of PCA and ICA (SVDPICA) and two-dimensional PCA (2DPCA) are the specific approaches adopted and further developed in this work. Ability of those methods to reduce the amount of clutter and unwanted signals present in GPR data have been investigated and reported in this thesis, suggesting that their use in automated analysis of GPR images is a possibility. Further analysis carried out in this work concentrated on analysing the performance of developed multivariate signal processing techniques and at the same time investigating the possibility of identifying and characterising the features of interest in pre-processed GPR images. The driving idea behind this part of work was to extract the resonant modes present in the individual traces of each GPR image and to use properties of those poles to characterise target. Three related but different methods have been implemented and applied in this work – Extended Prony, Linear Prediction Singular Value Decomposition and Matrix Pencil methods. In addition to these approaches, PCA technique has been used to reduce dimensionality of extracted traces and to compare signals measured in various experimental setups. Performance analysis shows that Matrix Pencil offers the best results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

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

16

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

17

Khare, Arjun. „ACT++ 3.0 : implementation of the actor model using POSIX threads /“. Master's thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-10242009-020041/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Wan, Charn Wing. „The political economy of digital copyright in Hong Kong /“. access full-text access abstract and table of contents, 2009. http://libweb.cityu.edu.hk/cgi-bin/ezdb/thesis.pl?jsd-slw-b23750893f.pdf.

Der volle Inhalt der Quelle

Annotation:

Thesis (JSD)--City University of Hong Kong, 2009.
"Submitted to School of Law in partial fulfillment of the requirements for the degree of Doctor of Juridical Science." Includes bibliographical references (leaves 435-452)

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Thomas, Muffy. „The imperative implementation of algebraic data types“. Thesis, University of St Andrews, 1988. http://hdl.handle.net/10023/13471.

Der volle Inhalt der Quelle

Annotation:

The synthesis of imperative programs for hierarchical, algebraically specified abstract data types is investigated. Two aspects of the synthesis are considered: the choice of data structures for efficient implementation, and the synthesis of linked implementations for the class of ADTs which insert and access data without explicit key. The methodology is based on an analysis of the algebraic semantics of the ADT. Operators are partitioned according to the behaviour of their corresponding operations in the initial algebra. A family of relations, the storage relations of an ADT, Is defined. They depend only on the operator partition and reflect an observational view of the ADT. The storage relations are extended to storage graphs: directed graphs with a subset of nodes designated for efficient access. The data structures in our imperative language are chosen according to properties of the storage relations and storage graphs. Linked implementations are synthesised in a stepwise manner by implementing the given ADT first by its storage graphs, and then by linked data structures in the imperative language. Some circumstances under which the resulting programs have constant time complexity are discussed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Fowler, Robert Joseph. „Decentralized object finding using forwarding address /“. Thesis, Connect to this title online; UW restricted, 1985. http://hdl.handle.net/1773/6947.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Chuang, Chien-Kuo Eric. „DIB on the Xerox workstation /“. Online version of thesis, 1986. http://hdl.handle.net/1850/8856.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Emerson, Glen D. „Projected performance requirements for personnel entering information processing jobs for the federal government /“. 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

26

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Clayton, Peter Graham. „Interrupt-generating active data objects“. Thesis, Rhodes University, 1990. http://hdl.handle.net/10962/d1006700.

Der volle Inhalt der Quelle

Annotation:

An investigation is presented into an interrupt-generating object model which is designed to reduce the effort of programming distributed memory multicomputer networks. The object model is aimed at the natural modelling of problem domains in which a number of concurrent entities interrupt one another as they lay claim to shared resources. The proposed computational model provides for the safe encapsulation of shared data, and incorporates inherent arbitration for simultaneous access to the data. It supplies a predicate triggering mechanism for use in conditional synchronization and as an alternative mechanism to polling. Linguistic support for the proposal requires a novel form of control structure which is able to interface sensibly with interrupt-generating active data objects. The thesis presents the proposal as an elemental language structure, with axiomatic guarantees which enforce safety properties and aid in program proving. The established theory of CSP is used to reason about the object model and its interface. An overview is presented of a programming language called HUL, whose semantics reflect the proposed computational model. Using the syntax of HUL, the application of the interrupt-generating active data object is illustrated. A range of standard concurrent problems is presented to demonstrate the properties of the interrupt-generating computational model. Furthermore, the thesis discusses implementation considerations which enable the model to be mapped precisely onto multicomputer networks, and which sustain the abstract programming level provided by the interrupt-generating active data object in the wider programming structures of HUL.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

胡九如 und Jiuru Hu. „Virtual property agency: electronic market with negotiation supports“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31222699.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

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

30

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

31

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

32

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

33

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Gardener, Michael Edwin. „A multichannel, general-purpose data logger“. Thesis, Cape Technikon, 1986. http://hdl.handle.net/20.500.11838/2179.

Der volle Inhalt der Quelle

Annotation:

Thesis (Diploma (Electrical Engineering))--Cape Technikon, 1986.
This thesis describes the implementation of a general-purpose, microprocessor-based Data Logger. The Hardware allows analog data acquisition from one to thirty two channels with 12 bit resolution and at a data throughput of up to 2KHz. The data is logged directly to a Buffer memory and from there, at the end of each 109, it is dumped to an integral cassette data recorder. The recorded data can be transfered from the logger to a desk-top computer, via the IEEE 488 port, for further processing and display. All log parameters are user selectable by means of menu prompted keyboard entry and a Real-Time clock (RTC) provides date and time information automatically.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

潘淑欣 und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Mailhe, Maxime. „Batch processing task optimization“. Thesis, Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/11893.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Kulatunga, Chamil. „Enforcing receiver-driven multicast congestion control using ECN-Nonce“. Thesis, Available from the University of Aberdeen Library and Historic Collections Digital Resources, 2009. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?application=DIGITOOL-3&owner=resourcediscovery&custom_att_2=simple_viewer&pid=33532.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Burke, Janice B. „The effects of informal computer keyboarding on straight copy speed and accuracy“. Thesis, This resource online, 1988. http://scholar.lib.vt.edu/theses/available/etd-04272010-020348/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Jedrziewski, Mary Ann. „Initial wrist posture during typing as a function of keyboard height and slope“. Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-05042010-020229/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Guven, Ahmet. „Speeding up a path-based policy language compiler“. Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03Mar%5FGuven.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

李隆賜 und Loong-chi Louis Lee. „The impact of electronic commerce on the travel industry“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31268973.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

46

Patterson, Joel E. „The porting of the MCC Extensible Software Platform to the Sequent Symmetry“. Master's thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-04272010-020129/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Huang, Shiping. „Exploratory visualization of data with variable quality“. Link to electronic thesis, 2005. http://www.wpi.edu/Pubs/ETD/Available/etd-01115-225546/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Bernabéu-Aubán, José Manuel. „Location finding algorithms for distributed systems“. Diss., Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/32951.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Konuru, Ravindranath Bala. „A migratable user-level process package for PVM /“. Full text open access at:, 1995. http://content.ohsu.edu/u?/etd,633.

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!