subject:(parallel)

1. Jain, Tarun K. Parallel Seismic Ray Tracing.

Degree: 2013, Texas Digital Library

URL: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66796

► Seismic ray tracing is a common method for understanding and modeling seismic wave propagation. The wavefront construction (WFC) method handles wavefronts instead of individual rays,… (more)

Subjects/Keywords: Parallel

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jain, T. K. (2013). Parallel Seismic Ray Tracing. (Thesis). Texas Digital Library. Retrieved from http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66796

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Jain, Tarun K. “Parallel Seismic Ray Tracing.” 2013. Thesis, Texas Digital Library. Accessed January 24, 2021. http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66796.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Jain, Tarun K. “Parallel Seismic Ray Tracing.” 2013. Web. 24 Jan 2021.

Vancouver:

Jain TK. Parallel Seismic Ray Tracing. [Internet] [Thesis]. Texas Digital Library; 2013. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66796.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jain TK. Parallel Seismic Ray Tracing. [Thesis]. Texas Digital Library; 2013. Available from: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66796

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

2. Balaji N. Evaluation of cluster computing tools And developing a novel distribution tool For an effective computational cluster;.

Degree: Evaluation of cluster computing tools And developing a novel distribution tool For an effective computational cluster, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/26376

►

newlineIncreasing computational capabilities is essential for continued newlineprogress of modern science and technology in all fields Parallel processing newlinehas been recognized as one of the… (more)

Subjects/Keywords: Parallel processing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

N, B. (2014). Evaluation of cluster computing tools And developing a novel distribution tool For an effective computational cluster;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26376

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

N, Balaji. “Evaluation of cluster computing tools And developing a novel distribution tool For an effective computational cluster;.” 2014. Thesis, Anna University. Accessed January 24, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/26376.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

N, Balaji. “Evaluation of cluster computing tools And developing a novel distribution tool For an effective computational cluster;.” 2014. Web. 24 Jan 2021.

Vancouver:

N B. Evaluation of cluster computing tools And developing a novel distribution tool For an effective computational cluster;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Jan 24]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26376.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

N B. Evaluation of cluster computing tools And developing a novel distribution tool For an effective computational cluster;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26376

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

3. Pearce, Roger Allan. Scalable Parallel Algorithms for Massive Scale-free Graphs.

Degree: 2013, Texas Digital Library

URL: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830

► Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage ???Big Data??? to answer next-generation scientific questions. New… (more)

▼ Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage ???Big Data??? to answer next-generation scientific questions. New techniques are required to process large scale-free graphs in shared, distributed, and external memory. This dissertation develops new techniques to parallelize the storage, computation, and communication for scale-free graphs with high-degree vertices. Our work facilitates the processing of large real-world graph datasets through the development of parallel algorithms and tools that scale to large computational and memory resources, overcoming challenges not addressed by existing techniques. Our aim is to scale to trillions of edges, and our research is targeted at leadership class supercomputers, clusters with local non-volatile memory, and shared memory systems. We present three novel techniques to address scaling challenges in processing large scale-free graphs. We apply an asynchronous graph traversal technique using prioritized visitor queues that is capable of tolerating data latencies to the external graph storage media and message passing communication. To accommodate large high-degree vertices, we present an edge list partitioning technique that evenly partitions graphs containing high-degree vertices. Finally, we propose a technique we call distributed delegates that distributes and parallelizes the storage, computation, and communication when processing high-degree vertices. The edges of high-degree vertices are distributed, providing additional opportunities for parallelism not present in existing methods. We apply our techniques to multiple graph algorithms: Breadth-First Search, Single Source Shortest Path, Connected Components, K-Core decomposition, Triangle Counting, and Page Rank. Our experimental study of these algorithms demonstrates excellent scalability on supercomputers, clusters with non-volatile memory, and shared memory systems. Our study includes multiple synthetic scale-free graph models, the largest of which has trillion edges, and real-world input graphs. On a supercomputer, we demonstrate scalability up to 131K processors, and improve the best known Graph500 results for IBM BG/P Intrepid by 15%. Advisors/Committee Members: Amato, Nancy M (advisor).

Subjects/Keywords: parallel algorithms

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pearce, R. A. (2013). Scalable Parallel Algorithms for Massive Scale-free Graphs. (Thesis). Texas Digital Library. Retrieved from http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Thesis, Texas Digital Library. Accessed January 24, 2021. http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Web. 24 Jan 2021.

Vancouver:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Internet] [Thesis]. Texas Digital Library; 2013. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Thesis]. Texas Digital Library; 2013. Available from: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Vilnius University

4. Zokaitytė, Asta. EB konkurencijos taisyklių taikymas veiksmams, ribojantiems paralelinę prekybą.

Degree: Master, 2011, Vilnius University

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20110709_152141-43866 ;

►

EB teismai ir Komisija tiek praeityje, tiek šiuo metu visus veiksmus, ribojančius paralelinę prekybą, laiko per se pažeidimais. Tokį EB institucijų požiūrio suformavimą paaiškina siekis… (more)

▼

EB teismai ir Komisija tiek praeityje, tiek šiuo metu visus veiksmus, ribojančius paralelinę prekybą, laiko per se pažeidimais. Tokį EB institucijų požiūrio suformavimą paaiškina siekis įgyvendinti svarbiausią EB tikslą – bendrosios rinkos sukūrimą. Tačiau mažėjanti integracinio tikslo reikšmė, sudėtingėjantis šio ir galutinio vartotojo gerbūvio didinimo tikslų santykis, neišvengiamai nulėmė požiūrio į paralelinę prekybą ribojančius veiksmus, keitimąsi. Pirmosios instancijos Teismo sprendimas GlaxoSmithKline byloje buvo pirmasis akivaizdus precedentas naujo požiūrio formavime. Nepaisant teismo konstatavimo, jog paralelinės prekybos ribojimas ne visuomet reiškia, kad yra ir konkurencijos ribojimo tikslas, autoriaus įsitikinimu, teismas galėjo išplėtoti konkurencijos ribojimo sąvoką. Autoriaus nuomone, paralelinės prekybos ribojimo teisinis reglamentavimas turėtų būti keičiamas. Paralelinę prekybą ribojantys veiksmai, atlikti inovaciniuose sektoriuose, neturėtų būti laikomi per se pažeidimu. Tuo tarpu visų kitų veiksmų teisinio reguliavimo keisti nereikėtų. Inovacinius sektorius reikėtų apibrėžti vadovaujantis patiriamų išlaidų tyrimams ir inovacijoms rodikliu, t.y., jeigu 30 procentų viso produkto kainos yra skiriama vystymui ir tyrimams, tokia ūkio šaka laikytina inovatyvia. Padarius išvadą, jog ne visi paralelinę prekybą ribojantys veiksmai turėtų būti laikomi tikslo ribojimais, svarbu išaiškinti konkurencijos ribojimo sąvoką. EB teismų dviprasmiški sprendimai, jog... [toliau žr. visą tekstą]

EU courts and the Commission hold that all agreements which restrict parallel trade are per se infringement. This kind of attitude was formulated subject to the implementation of the ultimate objective of the EU – single market objective. But the receding significance of the single market objective and advanced relationship between the single market objective and the final consumer objective determinated the change of this attitude. The decision of the First Instance Court in GlaxoSmithKline case was the first and evident precedent in formulation of the new attitude. Despite the court’s statement that not all the agreements which restrict parallel trade have as their object the restriction of competition, in the author’s point of view the court might have explicated the concept of the restriction of competition. The author considers that the attitude to the restrictions of parallel trade should be changed. The agreements restricting parallel trade in the innovative sectors should not be regarded as per se infringements. Whereas the agreements restricting parallel trade which are not concluded in the innovative sector should be regarded as per se infringements. The innovative sectors should be determined subject to the rate of the expenses which the undertaking sustains to make innovative decisions. For instance if the expenses for research and development are 30 or even more percent of the total product, the sector might be determined as innovative. Besides these conclusions,... [to full text]

Advisors/Committee Members: Juonys, Marius (Master's thesis supervisor).

Subjects/Keywords: Parallel; Trade

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zokaitytė, Asta. (2011). EB konkurencijos taisyklių taikymas veiksmams, ribojantiems paralelinę prekybą. (Masters Thesis). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20110709_152141-43866 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16^th Edition):

Zokaitytė, Asta. “EB konkurencijos taisyklių taikymas veiksmams, ribojantiems paralelinę prekybą.” 2011. Masters Thesis, Vilnius University. Accessed January 24, 2021. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20110709_152141-43866 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7^th Edition):

Zokaitytė, Asta. “EB konkurencijos taisyklių taikymas veiksmams, ribojantiems paralelinę prekybą.” 2011. Web. 24 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Zokaitytė, Asta. EB konkurencijos taisyklių taikymas veiksmams, ribojantiems paralelinę prekybą. [Internet] [Masters thesis]. Vilnius University; 2011. [cited 2021 Jan 24]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20110709_152141-43866 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Zokaitytė, Asta. EB konkurencijos taisyklių taikymas veiksmams, ribojantiems paralelinę prekybą. [Masters Thesis]. Vilnius University; 2011. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20110709_152141-43866 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

5. Zulian, Patrick. Geometry–aware finite element framework for multi–physics simulations: an algorithmic and software-centric perspective.

Degree: 2017, Università della Svizzera italiana

URL: http://doc.rero.ch/record/304964

► In finite element simulations, the handling of geometrical objects and their discrete representation is a critical aspect in both serial and parallel scientific software environments.… (more)

▼ In finite element simulations, the handling of geometrical objects and their discrete representation is a critical aspect in both serial and parallel scientific software environments. The development of codes targeting such envinronments is subject to great development effort and man-hours invested. In this thesis we approach these issues from three fronts. First, stable and efficient techniques for the transfer of discrete fields between non matching volume or surface meshes are an essential ingredient for the discretization and numerical solution of coupled multi-physics and multi-scale problems. In particular L2-projections allows for the transfer of discrete fields between unstructured meshes, both in the volume and on the surface. We present an algorithm for parallelizing the assembly of the L2-transfer operator for unstructured meshes which are arbitrarily distributed among different processes. The algorithm requires no a priori information on the geometrical relationship between the different meshes. Second, the geometric representation is often a limiting factor which imposes a trade-off between how accurately the shape is described, and what methods can be employed for solving a system of differential equations. Parametric finite-elements and bijective mappings between polygons or polyhedra allow us to flexibly construct finite element discretizations with arbitrary resolutions without sacrificing the accuracy of the shape description. Such flexibility allows employing state-of-the-art techniques, such as geometric multigrid methods, on meshes with almost any shape.t, the way numerical techniques are represented in software libraries and approached from a development perspective, affect both usability and maintainability of such libraries. Completely separating the intent of high-level routines from the actual implementation and technologies allows for portable and maintainable performance. We provide an overview on current trends in the development of scientific software and showcase our open-source library utopia. Advisors/Committee Members: Rolf (Dir.).

Subjects/Keywords: Parallel computing

11 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zulian, P. (2017). Geometry–aware finite element framework for multi–physics simulations: an algorithmic and software-centric perspective. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/304964

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zulian, Patrick. “Geometry–aware finite element framework for multi–physics simulations: an algorithmic and software-centric perspective.” 2017. Thesis, Università della Svizzera italiana. Accessed January 24, 2021. http://doc.rero.ch/record/304964.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zulian, Patrick. “Geometry–aware finite element framework for multi–physics simulations: an algorithmic and software-centric perspective.” 2017. Web. 24 Jan 2021.

Vancouver:

Zulian P. Geometry–aware finite element framework for multi–physics simulations: an algorithmic and software-centric perspective. [Internet] [Thesis]. Università della Svizzera italiana; 2017. [cited 2021 Jan 24]. Available from: http://doc.rero.ch/record/304964.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zulian P. Geometry–aware finite element framework for multi–physics simulations: an algorithmic and software-centric perspective. [Thesis]. Università della Svizzera italiana; 2017. Available from: http://doc.rero.ch/record/304964

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Ryerson University

6. Yu, Aaron. Kinematic Modelling of a Panel Enclosed Mechanism.

Degree: 2015, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A4190

► This thesis presents a new method for kinematic modeling and analysis of a six degree-of-freedom parallel robot enclosed by a number of sliding panels, called… (more)

Subjects/Keywords: Robots – Kinematics; Parallel robots; Parallel kinematic machines

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yu, A. (2015). Kinematic Modelling of a Panel Enclosed Mechanism. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A4190

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Yu, Aaron. “Kinematic Modelling of a Panel Enclosed Mechanism.” 2015. Thesis, Ryerson University. Accessed January 24, 2021. https://digital.library.ryerson.ca/islandora/object/RULA%3A4190.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Yu, Aaron. “Kinematic Modelling of a Panel Enclosed Mechanism.” 2015. Web. 24 Jan 2021.

Vancouver:

Yu A. Kinematic Modelling of a Panel Enclosed Mechanism. [Internet] [Thesis]. Ryerson University; 2015. [cited 2021 Jan 24]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A4190.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yu A. Kinematic Modelling of a Panel Enclosed Mechanism. [Thesis]. Ryerson University; 2015. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A4190

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universiteit Utrecht

7. Voitzwinkler, Fanny. Serbian-run structures of governance in post-independence Kosovo: the logics of dual governance and its impacts on group boundary making and local dynamics of support for Belgrade's elites in the Kosovo Serb community.

Degree: 2008, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/30760

► To what extent does the maintenance of Serbian-run structures in Kosovo reinforce group boundaries in Kosovo Serb settlements? The Kosovo Serb community is very often… (more)

Subjects/Keywords: Letteren; Kosovo; parallel

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Voitzwinkler, F. (2008). Serbian-run structures of governance in post-independence Kosovo: the logics of dual governance and its impacts on group boundary making and local dynamics of support for Belgrade's elites in the Kosovo Serb community. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/30760

Chicago Manual of Style (16^th Edition):

Voitzwinkler, Fanny. “Serbian-run structures of governance in post-independence Kosovo: the logics of dual governance and its impacts on group boundary making and local dynamics of support for Belgrade's elites in the Kosovo Serb community.” 2008. Masters Thesis, Universiteit Utrecht. Accessed January 24, 2021. http://dspace.library.uu.nl:8080/handle/1874/30760.

MLA Handbook (7^th Edition):

Voitzwinkler, Fanny. “Serbian-run structures of governance in post-independence Kosovo: the logics of dual governance and its impacts on group boundary making and local dynamics of support for Belgrade's elites in the Kosovo Serb community.” 2008. Web. 24 Jan 2021.

Vancouver:

Voitzwinkler F. Serbian-run structures of governance in post-independence Kosovo: the logics of dual governance and its impacts on group boundary making and local dynamics of support for Belgrade's elites in the Kosovo Serb community. [Internet] [Masters thesis]. Universiteit Utrecht; 2008. [cited 2021 Jan 24]. Available from: http://dspace.library.uu.nl:8080/handle/1874/30760.

Council of Science Editors:

Voitzwinkler F. Serbian-run structures of governance in post-independence Kosovo: the logics of dual governance and its impacts on group boundary making and local dynamics of support for Belgrade's elites in the Kosovo Serb community. [Masters Thesis]. Universiteit Utrecht; 2008. Available from: http://dspace.library.uu.nl:8080/handle/1874/30760

Texas A&M University

8. Wang, Huhu. Experimental Study of the Turbulent Mixing of Two Parallel Jets for Benchmarking Numerical Models.

Degree: PhD, Nuclear Engineering, 2015, Texas A&M University

URL: http://hdl.handle.net/1969.1/156442

► Turbulent mixing of parallel jet flows has broad engineering applications. For example, in Gen IV conceptual nuclear reactors, high-temperature flows mix in the lower plenum… (more)

Subjects/Keywords: Parallel Jets; PIV

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wang, H. (2015). Experimental Study of the Turbulent Mixing of Two Parallel Jets for Benchmarking Numerical Models. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/156442

Chicago Manual of Style (16^th Edition):

Wang, Huhu. “Experimental Study of the Turbulent Mixing of Two Parallel Jets for Benchmarking Numerical Models.” 2015. Doctoral Dissertation, Texas A&M University. Accessed January 24, 2021. http://hdl.handle.net/1969.1/156442.

MLA Handbook (7^th Edition):

Wang, Huhu. “Experimental Study of the Turbulent Mixing of Two Parallel Jets for Benchmarking Numerical Models.” 2015. Web. 24 Jan 2021.

Vancouver:

Wang H. Experimental Study of the Turbulent Mixing of Two Parallel Jets for Benchmarking Numerical Models. [Internet] [Doctoral dissertation]. Texas A&M University; 2015. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/1969.1/156442.

Council of Science Editors:

Wang H. Experimental Study of the Turbulent Mixing of Two Parallel Jets for Benchmarking Numerical Models. [Doctoral Dissertation]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/156442

University of Victoria

9. Afsahi, Ahmad. Design and evaluation of communication latency hiding/reduction techniques for message-passing environments.

Degree: Department of Electrical and Computer Engineering, 2018, University of Victoria

URL: https://dspace.library.uvic.ca//handle/1828/9003

► With the availability of fast microprocessors and small-scale multiprocessors, internode communication has become an increasingly important factor that limits the performance of parallel computers. Essentially,… (more)

▼ With the availability of fast microprocessors and small-scale multiprocessors, internode communication has become an increasingly important factor that limits the performance of parallel computers. Essentially, message-passing parallel computers require extremely short communication latency such that message transmissions have minimal impact on the overall computation time. This thesis concentrates on issues regarding hardware communication latency in single-hop reconfigurable networks, and software communication latency regardless of the type of network. The first contribution of this thesis is the design and evaluation of two different categories of prediction techniques for message-passing systems. This thesis utilizes the communications locality property of message-passing parallel applications to devise a number of heuristics that can be used to predict the target of subsequent communication requests, and to predict the next consumable message at the receiving ends of communications. Specifically, I propose two sets of predictors: Cycle-based predictors, which are purely dynamic predictors, and Tag-based predictors, which are static/dynamic predictors. The performance of the proposed predictors, specially Better-cycle2 and Tag-bettercycle2, are very well on the application benchmarks studied in this thesis. The proposed predictors could be easily implemented on the network interface due to their simple algorithms and low memory requirements. As the second contribution of this thesis, I show that majority of reconfiguration delays in single-hop reconfigurable networks can be hidden by using one of the proposed high hit ratio predictors. The proposed predictors can be used in establishing a communication pathway between a source and a destination in such networks before this pathway is to be used. This thesis' third contribution is the analysis of a broadcasting algorithm that utilizes latency hiding and reconfiguration in the network to speed the broadcasting operation. The analysis brings up closed formulations that yields the termination time of the algorithms. The thesis' fourth contribution is a new total exchange algorithm in single-hop reconfigurable networks. I conjecture that this algorithm ensures a better termination time than what can be achieved by either of the direct, and standard exchange algorithms. The fifth contribution of this thesis is the use and evaluation of the proposed predictors to predict the next consumable message at the receiving ends of communications. This thesis contributes by claiming that these message predictors can be efficiently used to drain the network and cache the incoming messages even if the corresponding receive calls have not been posted yet. This way, there is no need to copy the early arriving messages into a temporary buffer. The performance of the proposed predictors, Single-cycle, Tag-cycle2 and Tag-bettercycle2, on the parallel applications are quite promising and suggest that prediction has the potential to eliminate most of the remaining… Advisors/Committee Members: Dimopoulos, Nikitas J. (supervisor).

Subjects/Keywords: Parallel computers; Communication

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Afsahi, A. (2018). Design and evaluation of communication latency hiding/reduction techniques for message-passing environments. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9003

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Afsahi, Ahmad. “Design and evaluation of communication latency hiding/reduction techniques for message-passing environments.” 2018. Thesis, University of Victoria. Accessed January 24, 2021. https://dspace.library.uvic.ca//handle/1828/9003.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Afsahi, Ahmad. “Design and evaluation of communication latency hiding/reduction techniques for message-passing environments.” 2018. Web. 24 Jan 2021.

Vancouver:

Afsahi A. Design and evaluation of communication latency hiding/reduction techniques for message-passing environments. [Internet] [Thesis]. University of Victoria; 2018. [cited 2021 Jan 24]. Available from: https://dspace.library.uvic.ca//handle/1828/9003.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Afsahi A. Design and evaluation of communication latency hiding/reduction techniques for message-passing environments. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9003

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. Loken, Torbjorn P. A Comparison of Massively Parallel Programming Models Through Applications in Sound Propagation and Jitter Measurement.

Degree: 2014, University of Nevada – Reno

URL: http://hdl.handle.net/11714/2879

► As the era of Moore's Law and increasing CPU clock rates nears its stopping point the focus of chip and hardware design has shifted to… (more)

Subjects/Keywords: GPGPU; Massively Parallel

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Loken, T. P. (2014). A Comparison of Massively Parallel Programming Models Through Applications in Sound Propagation and Jitter Measurement. (Thesis). University of Nevada – Reno. Retrieved from http://hdl.handle.net/11714/2879

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Loken, Torbjorn P. “A Comparison of Massively Parallel Programming Models Through Applications in Sound Propagation and Jitter Measurement.” 2014. Thesis, University of Nevada – Reno. Accessed January 24, 2021. http://hdl.handle.net/11714/2879.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Loken, Torbjorn P. “A Comparison of Massively Parallel Programming Models Through Applications in Sound Propagation and Jitter Measurement.” 2014. Web. 24 Jan 2021.

Vancouver:

Loken TP. A Comparison of Massively Parallel Programming Models Through Applications in Sound Propagation and Jitter Measurement. [Internet] [Thesis]. University of Nevada – Reno; 2014. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/11714/2879.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Loken TP. A Comparison of Massively Parallel Programming Models Through Applications in Sound Propagation and Jitter Measurement. [Thesis]. University of Nevada – Reno; 2014. Available from: http://hdl.handle.net/11714/2879

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

11. Sun, Nan Nan. Development of a New High Speed Cable-Based Planar Parallel Manipulator.

Degree: 2012, University of Waterloo

URL: http://hdl.handle.net/10012/6605

► Industrial robots and automation technology have advanced rapidly in the last several decades. New types of manipulators that uses parallel mechanisms are becoming more popular… (more)

▼ Industrial robots and automation technology have advanced rapidly in the last several decades. New types of manipulators that uses parallel mechanisms are becoming more popular due to their high speed and high stiffness. This thesis focuses on a sub-class of parallel manipulators that uses cables to replace rigid links for further increase in speed. The design strategies in this study were expanded from research works by Khajepour. Behzadipour, and Edmon Chan. This thesis presents analysis and development of a new cable-based planar parallel manipulator that is based on a previous prototype built by Edmon Chan. The new manipulator design added a new rotational DOF to the end-effector, and the number of cables are doubled in order to increase the stiffness. New methods for kinematics and dynamics analysis are formulated to make the procedure more systematic. A new mathematical formulation for stiffness matrix of the end-effector is presented. The resultant stiffness matrix is equivalent to the stiffness matrix formulated by Behzadipour. Additional stiffness analysis is conducted on valid range of stiffness calculation and comparison of different cable configurations. A multi-objective optimization problem is formulated in order to search for the best set of design parameters for the manipulator, and it is solved with an exhaustive complete search method. A physical prototype of the manipulator is modelled and manufactured with the help of partners from Conestoga college. Experiments with the manipulator show that more powerful motors are needed to run the robot at full speed. Motor torque measurements show that the dynamics analysis of the manipulator is valid. Stiffness of the manipulator is measured by applying external force to the end-effector, and it is shown to be strong. The manipulator is able to demonstrate a sort and pick-and-place operation at 60 cycles per minute while running at 70% of the maximum speed, with an acceleration of 2.8 g and velocity of 4 m/s.

Subjects/Keywords: cable; parallel manipulator

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sun, N. N. (2012). Development of a New High Speed Cable-Based Planar Parallel Manipulator. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6605

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Sun, Nan Nan. “Development of a New High Speed Cable-Based Planar Parallel Manipulator.” 2012. Thesis, University of Waterloo. Accessed January 24, 2021. http://hdl.handle.net/10012/6605.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Sun, Nan Nan. “Development of a New High Speed Cable-Based Planar Parallel Manipulator.” 2012. Web. 24 Jan 2021.

Vancouver:

Sun NN. Development of a New High Speed Cable-Based Planar Parallel Manipulator. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/10012/6605.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sun NN. Development of a New High Speed Cable-Based Planar Parallel Manipulator. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6605

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

California State University – Sacramento

12. Jadhav, Pramukh Narayan Rao. Performance evaluation of Oracle parallel execution.

Degree: MS, Computer Science, 2011, California State University – Sacramento

URL: http://hdl.handle.net/10211.9/1141

► To utilize the vast number of resources like multi-processors and large amount of memory that are available with the new age computers, Oracle has come… (more)

Subjects/Keywords: Oracle parallel query

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jadhav, P. N. R. (2011). Performance evaluation of Oracle parallel execution. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.9/1141

Chicago Manual of Style (16^th Edition):

Jadhav, Pramukh Narayan Rao. “Performance evaluation of Oracle parallel execution.” 2011. Masters Thesis, California State University – Sacramento. Accessed January 24, 2021. http://hdl.handle.net/10211.9/1141.

MLA Handbook (7^th Edition):

Jadhav, Pramukh Narayan Rao. “Performance evaluation of Oracle parallel execution.” 2011. Web. 24 Jan 2021.

Vancouver:

Jadhav PNR. Performance evaluation of Oracle parallel execution. [Internet] [Masters thesis]. California State University – Sacramento; 2011. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/10211.9/1141.

Council of Science Editors:

Jadhav PNR. Performance evaluation of Oracle parallel execution. [Masters Thesis]. California State University – Sacramento; 2011. Available from: http://hdl.handle.net/10211.9/1141

University of Texas – Austin

13. -8499-7554. Galois : a system for parallel execution of irregular algorithms.

Degree: PhD, Computer Sciences, 2015, University of Texas – Austin

URL: http://hdl.handle.net/2152/30536

► A programming model which allows users to program with high productivity and which produces high performance executions has been a goal for decades. This dissertation… (more)

Subjects/Keywords: Parallel programming; Multicore

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-8499-7554. (2015). Galois : a system for parallel execution of irregular algorithms. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/30536

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16^th Edition):

-8499-7554. “Galois : a system for parallel execution of irregular algorithms.” 2015. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/30536.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7^th Edition):

-8499-7554. “Galois : a system for parallel execution of irregular algorithms.” 2015. Web. 24 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-8499-7554. Galois : a system for parallel execution of irregular algorithms. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2015. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/30536.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-8499-7554. Galois : a system for parallel execution of irregular algorithms. [Doctoral Dissertation]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/30536

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Louisiana State University

14. Yang, Shuangyang. A Persistent Storage Model for Extreme Computing.

Degree: PhD, Computer Sciences, 2014, Louisiana State University

URL: etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910

► The continuing technological progress resulted in a dramatic growth in aggregate computational performance of the largest supercomputing systems. Unfortunately, these advances did not translate to… (more)

▼ The continuing technological progress resulted in a dramatic growth in aggregate computational performance of the largest supercomputing systems. Unfortunately, these advances did not translate to the required extent into accompanying I/O systems and little more in terms of architecture or effective access latency. New classes of algorithms developed for massively parallel applications, that gracefully handle the challenges of asynchrony, heavily multi-threaded distributed codes, and message-driven computation, must be matched by similar advances in I/O methods and algorithms to produce a well performing and balanced supercomputing system. This dissertation proposes PXFS, a storage model for persistent objects inspired by the ParalleX model of execution that addresses many of these challenges. The PXFS model is designed to be asynchronous in nature to comply with ParalleX model and proposes an active TupleSpace concept to hold all kinds of metadata/meta-object for either storage objects or runtime objects. The new active TupleSpace can also register ParalleX actions to be triggered under certain tuple operations. An first implementation of PXFS utilizing a well-known Orange parallel file system as its back-end via asynchronous I/O layer and the implementation of TupleSpace component in HPX, the implementation of ParalleX. These details are also described along with the preliminary performance data. A house-made micro benchmark is developed to measure the disk I/O throughput of the PXFS asynchronous interface. The results show perfect scalability and 3x to 20x times speedup of I/O throughput performance comparing to OrangeFS synchronous user interface. Use cases of TupleSpace components are discussed for real-world applications including micro check-pointing. By utilizing TupleSpace in HPX applications for I/O, global barrier can be replaced with fine-grained parallelism to overlap more computation with communication and greatly boost the performance and efficiency. Also the dissertation showcases the distributed directory service in Orange file system which process directory entries in parallel and effectively improves the directory metada operations.

Subjects/Keywords: parallel computing; parallel file system; parallel runtime system

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yang, S. (2014). A Persistent Storage Model for Extreme Computing. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910

Chicago Manual of Style (16^th Edition):

Yang, Shuangyang. “A Persistent Storage Model for Extreme Computing.” 2014. Doctoral Dissertation, Louisiana State University. Accessed January 24, 2021. etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910.

MLA Handbook (7^th Edition):

Yang, Shuangyang. “A Persistent Storage Model for Extreme Computing.” 2014. Web. 24 Jan 2021.

Vancouver:

Yang S. A Persistent Storage Model for Extreme Computing. [Internet] [Doctoral dissertation]. Louisiana State University; 2014. [cited 2021 Jan 24]. Available from: etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910.

Council of Science Editors:

Yang S. A Persistent Storage Model for Extreme Computing. [Doctoral Dissertation]. Louisiana State University; 2014. Available from: etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910

Universiteit Utrecht

15. Kurt, H. Improving the Mondriaan vector distribution.

Degree: 2016, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/327907

► Mondriaan is a hypergraph based matrix partitioner, used to distribute the matrix and vectors in parallel sparse matrix-vector multiplication (SpMV) when calculating the product u=Av.… (more)

Subjects/Keywords: parallel algorithms; mondriaan; vector distribution

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kurt, H. (2016). Improving the Mondriaan vector distribution. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/327907

Chicago Manual of Style (16^th Edition):

Kurt, H. “Improving the Mondriaan vector distribution.” 2016. Masters Thesis, Universiteit Utrecht. Accessed January 24, 2021. http://dspace.library.uu.nl:8080/handle/1874/327907.

MLA Handbook (7^th Edition):

Kurt, H. “Improving the Mondriaan vector distribution.” 2016. Web. 24 Jan 2021.

Vancouver:

Kurt H. Improving the Mondriaan vector distribution. [Internet] [Masters thesis]. Universiteit Utrecht; 2016. [cited 2021 Jan 24]. Available from: http://dspace.library.uu.nl:8080/handle/1874/327907.

Council of Science Editors:

Kurt H. Improving the Mondriaan vector distribution. [Masters Thesis]. Universiteit Utrecht; 2016. Available from: http://dspace.library.uu.nl:8080/handle/1874/327907

16. DUARTE, Rafael Machado. Parallelizing Java programs using transformation laws .

Degree: 2008, Universidade Federal de Pernambuco

URL: http://repositorio.ufpe.br/handle/123456789/2357

► Com a adoção pelo mercado dos processadores de nucleos multiplos, o uso de threads em Java se torna cada vez mais proveitoso. O desenvolvimento de… (more)

Subjects/Keywords: Java; Parallel Programming; Transformation Laws

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

DUARTE, R. M. (2008). Parallelizing Java programs using transformation laws . (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/2357

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

DUARTE, Rafael Machado. “Parallelizing Java programs using transformation laws .” 2008. Thesis, Universidade Federal de Pernambuco. Accessed January 24, 2021. http://repositorio.ufpe.br/handle/123456789/2357.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

DUARTE, Rafael Machado. “Parallelizing Java programs using transformation laws .” 2008. Web. 24 Jan 2021.

Vancouver:

DUARTE RM. Parallelizing Java programs using transformation laws . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2008. [cited 2021 Jan 24]. Available from: http://repositorio.ufpe.br/handle/123456789/2357.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

DUARTE RM. Parallelizing Java programs using transformation laws . [Thesis]. Universidade Federal de Pernambuco; 2008. Available from: http://repositorio.ufpe.br/handle/123456789/2357

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

17. Darling, Andrew. Parallel implementation of maximum parsimony search algorithm on multicore CPUs.

Degree: 2011, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/5445

► Phylogenetics is the study of the evolutionary relationships among species. It is derived from the ancient greek words, phylon meaning "race", and genetikos, meaning "relative… (more)

Subjects/Keywords: Maximum parsimony; Multicore CPUs; Parallel

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Darling, A. (2011). Parallel implementation of maximum parsimony search algorithm on multicore CPUs. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/5445

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Darling, Andrew. “Parallel implementation of maximum parsimony search algorithm on multicore CPUs.” 2011. Thesis, Rochester Institute of Technology. Accessed January 24, 2021. https://scholarworks.rit.edu/theses/5445.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Darling, Andrew. “Parallel implementation of maximum parsimony search algorithm on multicore CPUs.” 2011. Web. 24 Jan 2021.

Vancouver:

Darling A. Parallel implementation of maximum parsimony search algorithm on multicore CPUs. [Internet] [Thesis]. Rochester Institute of Technology; 2011. [cited 2021 Jan 24]. Available from: https://scholarworks.rit.edu/theses/5445.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Darling A. Parallel implementation of maximum parsimony search algorithm on multicore CPUs. [Thesis]. Rochester Institute of Technology; 2011. Available from: https://scholarworks.rit.edu/theses/5445

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

18. Clark, Scott. Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization.

Degree: PhD, Applied Mathematics, 2012, Cornell University

URL: http://hdl.handle.net/1813/31145

► This is a dissertation in three parts, in each we explore the development and analysis of a parallel statistical or machine learning algorithm and its… (more)

Subjects/Keywords: bioinformatics; parallel algorithms; machine learning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Clark, S. (2012). Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/31145

Chicago Manual of Style (16^th Edition):

Clark, Scott. “Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization.” 2012. Doctoral Dissertation, Cornell University. Accessed January 24, 2021. http://hdl.handle.net/1813/31145.

MLA Handbook (7^th Edition):

Clark, Scott. “Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization.” 2012. Web. 24 Jan 2021.

Vancouver:

Clark S. Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization. [Internet] [Doctoral dissertation]. Cornell University; 2012. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/1813/31145.

Council of Science Editors:

Clark S. Parallel Machine Learning Algorithms In Bioinformatics And Global Optimization. [Doctoral Dissertation]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/31145

19. Hamsapriya T. Certain investigations on parallel Computing for engineering Applications;.

Degree: Certain investigations on parallel Computing for engineering Applications, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/29893

►

The need for faster computers is driven by the demands of both newlineComputation intensive applications in science and engineering and dataintensive newlineapplications in commerce The… (more)

Subjects/Keywords: Dataintensive applications; Parallel computing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

T, H. (2014). Certain investigations on parallel Computing for engineering Applications;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/29893

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

T, Hamsapriya. “Certain investigations on parallel Computing for engineering Applications;.” 2014. Thesis, Anna University. Accessed January 24, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/29893.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

T, Hamsapriya. “Certain investigations on parallel Computing for engineering Applications;.” 2014. Web. 24 Jan 2021.

Vancouver:

T H. Certain investigations on parallel Computing for engineering Applications;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Jan 24]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/29893.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

T H. Certain investigations on parallel Computing for engineering Applications;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/29893

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Anna University

20. Rajeswari N. Heuristics for parallel flow scheduling with due date based objective;.

Degree: Heuristics for parallel flow scheduling with due date based objective, 2015, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/34349

►

Scheduling theory is concerned with the allocation of a set of limited newlineresources to process a given number of jobs In fact a scheduling problem… (more)

Subjects/Keywords: Heuristics; mechanical engineering; parallel flow

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

N, R. (2015). Heuristics for parallel flow scheduling with due date based objective;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/34349

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

N, Rajeswari. “Heuristics for parallel flow scheduling with due date based objective;.” 2015. Thesis, Anna University. Accessed January 24, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/34349.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

N, Rajeswari. “Heuristics for parallel flow scheduling with due date based objective;.” 2015. Web. 24 Jan 2021.

Vancouver:

N R. Heuristics for parallel flow scheduling with due date based objective;. [Internet] [Thesis]. Anna University; 2015. [cited 2021 Jan 24]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34349.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

N R. Heuristics for parallel flow scheduling with due date based objective;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34349

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

21. Bani Ahmad, Mohammad Tareq Hussein. Computational Fluid Dynamics Analysis of Isothermal and Non-Isothermal Twin Jets.

Degree: MS, Nuclear Engineering, 2017, Texas A&M University

URL: http://hdl.handle.net/1969.1/169644

► This study has been conducted in a partial fulfillment of a master of science degree in nuclear engineering from the department of nuclear engineering at… (more)

Subjects/Keywords: Twin Jets; Parallel Jets

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bani Ahmad, M. T. H. (2017). Computational Fluid Dynamics Analysis of Isothermal and Non-Isothermal Twin Jets. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/169644

Chicago Manual of Style (16^th Edition):

Bani Ahmad, Mohammad Tareq Hussein. “Computational Fluid Dynamics Analysis of Isothermal and Non-Isothermal Twin Jets.” 2017. Masters Thesis, Texas A&M University. Accessed January 24, 2021. http://hdl.handle.net/1969.1/169644.

MLA Handbook (7^th Edition):

Bani Ahmad, Mohammad Tareq Hussein. “Computational Fluid Dynamics Analysis of Isothermal and Non-Isothermal Twin Jets.” 2017. Web. 24 Jan 2021.

Vancouver:

Bani Ahmad MTH. Computational Fluid Dynamics Analysis of Isothermal and Non-Isothermal Twin Jets. [Internet] [Masters thesis]. Texas A&M University; 2017. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/1969.1/169644.

Council of Science Editors:

Bani Ahmad MTH. Computational Fluid Dynamics Analysis of Isothermal and Non-Isothermal Twin Jets. [Masters Thesis]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/169644

Texas A&M University

22. Ghosh, Vivek. Matrix Acidizing Parallel Core Flooding Apparatus.

Degree: MS, Petroleum Engineering, 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/150997

► Matrix acidizing is a well stimulation procedure where acid is injected down the wellbore or coil tubing and into the reservoir near the wellbore region.… (more)

Subjects/Keywords: matrix acidizing; core flooding; parallel

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ghosh, V. (2013). Matrix Acidizing Parallel Core Flooding Apparatus. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/150997

Chicago Manual of Style (16^th Edition):

Ghosh, Vivek. “Matrix Acidizing Parallel Core Flooding Apparatus.” 2013. Masters Thesis, Texas A&M University. Accessed January 24, 2021. http://hdl.handle.net/1969.1/150997.

MLA Handbook (7^th Edition):

Ghosh, Vivek. “Matrix Acidizing Parallel Core Flooding Apparatus.” 2013. Web. 24 Jan 2021.

Vancouver:

Ghosh V. Matrix Acidizing Parallel Core Flooding Apparatus. [Internet] [Masters thesis]. Texas A&M University; 2013. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/1969.1/150997.

Council of Science Editors:

Ghosh V. Matrix Acidizing Parallel Core Flooding Apparatus. [Masters Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/150997

Texas A&M University

23. Liu, Yinan. RF Pulse Design for Parallel Excitation in Magnetic Resonance Imaging.

Degree: PhD, Electrical Engineering, 2012, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11113

► Parallel excitation is an emerging technique to improve or accelerate multi-dimensional spatially selective excitations in magnetic resonance imaging (MRI) using multi-channel transmit arrays. The technique… (more)

Subjects/Keywords: parallel excitation; RF; SAR

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liu, Y. (2012). RF Pulse Design for Parallel Excitation in Magnetic Resonance Imaging. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11113

Chicago Manual of Style (16^th Edition):

Liu, Yinan. “RF Pulse Design for Parallel Excitation in Magnetic Resonance Imaging.” 2012. Doctoral Dissertation, Texas A&M University. Accessed January 24, 2021. http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11113.

MLA Handbook (7^th Edition):

Liu, Yinan. “RF Pulse Design for Parallel Excitation in Magnetic Resonance Imaging.” 2012. Web. 24 Jan 2021.

Vancouver:

Liu Y. RF Pulse Design for Parallel Excitation in Magnetic Resonance Imaging. [Internet] [Doctoral dissertation]. Texas A&M University; 2012. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11113.

Council of Science Editors:

Liu Y. RF Pulse Design for Parallel Excitation in Magnetic Resonance Imaging. [Doctoral Dissertation]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11113

Texas A&M University

24. Hoxha, Dielli. Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework.

Degree: MS, Computer Engineering, 2016, Texas A&M University

URL: http://hdl.handle.net/1969.1/157157

► Applications of matrices are found in most scientiﬁc ﬁelds, such as physics, computer graphics, numerical analysis, etc. The high applicability of matrix algorithms and representations… (more)

Subjects/Keywords: Parallel Computing; Sparse Matrix

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hoxha, D. (2016). Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/157157

Chicago Manual of Style (16^th Edition):

Hoxha, Dielli. “Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework.” 2016. Masters Thesis, Texas A&M University. Accessed January 24, 2021. http://hdl.handle.net/1969.1/157157.

MLA Handbook (7^th Edition):

Hoxha, Dielli. “Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework.” 2016. Web. 24 Jan 2021.

Vancouver:

Hoxha D. Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework. [Internet] [Masters thesis]. Texas A&M University; 2016. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/1969.1/157157.

Council of Science Editors:

Hoxha D. Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework. [Masters Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/157157

25. Liu, Zhiyu. Theory and Applications of Parallelism with Futures.

Degree: Department of Computer Science, 2017, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:733422/

► Futures are an attractive way to structure parallel computations. When a thread creates an expression with a keyword future, a new thread is spawned to… (more)

▼ Futures are an attractive way to structure parallel computations. When a thread creates an expression with a keyword future, a new thread is spawned to compute that expression in parallel. When a thread later applies a touch operation to that future, it gets the result of the expression if the result has been computed, and otherwise blocks until the result becomes ready. In this thesis, we explore different aspects of parallel programs with futures, including their theoretical bounds, scheduling, and applications. Researchers have shown futures can have a deleterious effect on cache locality. We will show, however, that if futures are used in a simple, disciplined way, then their negative impact can be much alleviated. This structured use of futures is characteristic of many parallel applications. Futures lend themselves well to dynamic scheduling algorithms, such as work stealing, that ensure high processor utilization. Implementing work stealing on hierarchical platforms, such as NUMA systems and distributed clusters, have recently drawn lots of attention. However, little has been explored on its theoretical bounds. We present lower and upper bounds of work stealing for fork-join programs, a well-studied subclass of parallel-future programs, on hierarchical systems. As originally conceived, a future encapsulates a functional computation without side-effects. Recently, however, futures have been proposed as a way to encapsulate method calls to shared data structures. We propose a new program model, that supports both normal futures without side-effects and linearizable futures that exist for their side-effects. Using this model, we propose the lazy work stealing scheduler that facilitates certain optimizations for linearizable futures and guarantees good time bounds. The processing-in-memory (PIM) model has reemerged recently as a solution to alleviating the growing speed discrepancy between CPU's computation and memory access, commonly known as the memory wall. In this model, some lightweight computing units are directly attached to the main memory, providing fast memory access. We study applications of linearizable futures in the PIM model: operation requests to concurrent data structures are sent as linearizable futures to those computing units to execute. These PIM-managed data structures can outperform state-of-the-art concurrent data structures in the literature. Advisors/Committee Members: Herlihy, Maurice (Advisor), Fonseca, Rodrigo (Reader), Upfal, Eli (Reader).

Subjects/Keywords: Parallel programming (Computer science)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liu, Z. (2017). Theory and Applications of Parallelism with Futures. (Thesis). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:733422/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Liu, Zhiyu. “Theory and Applications of Parallelism with Futures.” 2017. Thesis, Brown University. Accessed January 24, 2021. https://repository.library.brown.edu/studio/item/bdr:733422/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Liu, Zhiyu. “Theory and Applications of Parallelism with Futures.” 2017. Web. 24 Jan 2021.

Vancouver:

Liu Z. Theory and Applications of Parallelism with Futures. [Internet] [Thesis]. Brown University; 2017. [cited 2021 Jan 24]. Available from: https://repository.library.brown.edu/studio/item/bdr:733422/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu Z. Theory and Applications of Parallelism with Futures. [Thesis]. Brown University; 2017. Available from: https://repository.library.brown.edu/studio/item/bdr:733422/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Ottawa

26. Lin, Yichao. Decontamination from Black Viruses Using Parallel Strategies .

Degree: 2018, University of Ottawa

URL: http://hdl.handle.net/10393/38237

► In this thesis, we consider the problem of decontaminating networks from black viruses (BVs) with a team of mobile agents, using parallel strategies. The BV… (more)

Subjects/Keywords: Black Viruses Decontamination; Parallel Strategies

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lin, Y. (2018). Decontamination from Black Viruses Using Parallel Strategies . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/38237

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lin, Yichao. “Decontamination from Black Viruses Using Parallel Strategies .” 2018. Thesis, University of Ottawa. Accessed January 24, 2021. http://hdl.handle.net/10393/38237.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lin, Yichao. “Decontamination from Black Viruses Using Parallel Strategies .” 2018. Web. 24 Jan 2021.

Vancouver:

Lin Y. Decontamination from Black Viruses Using Parallel Strategies . [Internet] [Thesis]. University of Ottawa; 2018. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/10393/38237.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lin Y. Decontamination from Black Viruses Using Parallel Strategies . [Thesis]. University of Ottawa; 2018. Available from: http://hdl.handle.net/10393/38237

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Wake Forest University

27. Farley, Ryan Joseph. Parallel Firewall Designs For High-Speed Networks.

Degree: 2005, Wake Forest University

URL: http://hdl.handle.net/10339/14906

► Firewalls enforce a security policy between two networks by comparing arriving packets against the policy rules to determine if they should be accepted or denied.… (more)

Subjects/Keywords: data parallel

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Farley, R. J. (2005). Parallel Firewall Designs For High-Speed Networks. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/14906

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Farley, Ryan Joseph. “Parallel Firewall Designs For High-Speed Networks.” 2005. Thesis, Wake Forest University. Accessed January 24, 2021. http://hdl.handle.net/10339/14906.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Farley, Ryan Joseph. “Parallel Firewall Designs For High-Speed Networks.” 2005. Web. 24 Jan 2021.

Vancouver:

Farley RJ. Parallel Firewall Designs For High-Speed Networks. [Internet] [Thesis]. Wake Forest University; 2005. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/10339/14906.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Farley RJ. Parallel Firewall Designs For High-Speed Networks. [Thesis]. Wake Forest University; 2005. Available from: http://hdl.handle.net/10339/14906

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Wake Forest University

28. Pryor, Edward E. PASSS: Protein Active Site Structure Search.

Degree: 2006, Wake Forest University

URL: http://hdl.handle.net/10339/33417

► The Protein Structure Initiative, a project on the scale of the Human Genome Project aimed at protein structure determination, has successfully identified the structure of… (more)

Subjects/Keywords: Parallel Programming

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pryor, E. E. (2006). PASSS: Protein Active Site Structure Search. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/33417

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Pryor, Edward E. “PASSS: Protein Active Site Structure Search.” 2006. Thesis, Wake Forest University. Accessed January 24, 2021. http://hdl.handle.net/10339/33417.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Pryor, Edward E. “PASSS: Protein Active Site Structure Search.” 2006. Web. 24 Jan 2021.

Vancouver:

Pryor EE. PASSS: Protein Active Site Structure Search. [Internet] [Thesis]. Wake Forest University; 2006. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/10339/33417.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pryor EE. PASSS: Protein Active Site Structure Search. [Thesis]. Wake Forest University; 2006. Available from: http://hdl.handle.net/10339/33417

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Open Universiteit Nederland

29. Verheul, J. Adaptive to change? Compositional modelling of Healthcare Insurances using Protocol Modelling .

Degree: 2011, Open Universiteit Nederland

URL: http://hdl.handle.net/1820/3731

► This report presents the results of research on application of Protocol Modelling in the domain of healthcare insurance claims processing in the Dutch context. The… (more)

Subjects/Keywords: Protocol Modelling; CSP parallel composition

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Verheul, J. (2011). Adaptive to change? Compositional modelling of Healthcare Insurances using Protocol Modelling . (Masters Thesis). Open Universiteit Nederland. Retrieved from http://hdl.handle.net/1820/3731

Chicago Manual of Style (16^th Edition):

Verheul, J. “Adaptive to change? Compositional modelling of Healthcare Insurances using Protocol Modelling .” 2011. Masters Thesis, Open Universiteit Nederland. Accessed January 24, 2021. http://hdl.handle.net/1820/3731.

MLA Handbook (7^th Edition):

Verheul, J. “Adaptive to change? Compositional modelling of Healthcare Insurances using Protocol Modelling .” 2011. Web. 24 Jan 2021.

Vancouver:

Verheul J. Adaptive to change? Compositional modelling of Healthcare Insurances using Protocol Modelling . [Internet] [Masters thesis]. Open Universiteit Nederland; 2011. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/1820/3731.

Council of Science Editors:

Verheul J. Adaptive to change? Compositional modelling of Healthcare Insurances using Protocol Modelling . [Masters Thesis]. Open Universiteit Nederland; 2011. Available from: http://hdl.handle.net/1820/3731

Oregon State University

30. Crandall, Phyllis E. Data decomposition and load balancing for networked data-parallel processing.

Degree: PhD, Computer Science, 1994, Oregon State University

URL: http://hdl.handle.net/1957/35543

Subjects/Keywords: Parallel computers

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Crandall, P. E. (1994). Data decomposition and load balancing for networked data-parallel processing. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/35543

Chicago Manual of Style (16^th Edition):

Crandall, Phyllis E. “Data decomposition and load balancing for networked data-parallel processing.” 1994. Doctoral Dissertation, Oregon State University. Accessed January 24, 2021. http://hdl.handle.net/1957/35543.

MLA Handbook (7^th Edition):

Crandall, Phyllis E. “Data decomposition and load balancing for networked data-parallel processing.” 1994. Web. 24 Jan 2021.

Vancouver:

Crandall PE. Data decomposition and load balancing for networked data-parallel processing. [Internet] [Doctoral dissertation]. Oregon State University; 1994. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/1957/35543.

Council of Science Editors:

Crandall PE. Data decomposition and load balancing for networked data-parallel processing. [Doctoral Dissertation]. Oregon State University; 1994. Available from: http://hdl.handle.net/1957/35543

Open Access Theses and Dissertations