Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 160 for “"Parallel machines"”.
-
Image pyramid segmentation using parallel machines
<p>This thesis describes two algorithms: parallel fuzzy pyramid linking (FPL) image segmentation for shared memory systems and parallel FPL image segmentation for distributed memory systems. The algorithms are designed for the purpose of increasing the speed of FPL which is a specific approach to …
-
Automatic visual recognition using parallel machines
… line invariants under perspective projection and parallel implementation of a dynamic programming technique for shape recognition. The feasibility of using parallel machines can be demonstrated through the dramatically reduced time complexity. In this dissertation, our algorithms are implemented …
-
Multigrid Algorithms for Massively Parallel Machines
… of the multigrid algorithm on massively parallel machines is not very efficient because of (i) low processor utilization and (ii) high communication overheads. These problems need to be addressed to make better use of massively parallel machines for solving pde's using the multigrid …
-
Incremental Program Transformation Using Abstract Parallel Machines
Parallel processing is a key area of high-performance computing, providing the processing power to meet the needs of computation-intensive problems. Much research effort has therefore been invested in this area and it is growing. However, there are still several challenges that hinder its …
-
Towards power of preemption on parallel machines
… processing of jobs, and those that do not. In parallel machine environments, scheduling problems for models which allow parallel processing of jobs are typically easier to solve, in terms of computational requirements, while these models are in the majority of cases associated with an improved …
-
Bi-criteria Scheduling Problems on Parallel Machines
… the study of bicriteria problems on single and parallel machines is an open field for research. This thesis is aimed at developing algorithms to solve bicriteria problems more efficiently and in reasonable amount of time and with little compromise on the optimality of the solutions obtained. Two …
-
Compilation techniques for irregular problems on parallel machines
Massively parallel computers have ushered in the era of teraflop computing. Even though large and powerful machines are being built, they are used by only a fraction of the computing community. The fundamental reason for this situation is that parallel machines are difficult to program. Development …
-
Fast Fourier Transforms on Distributed Memory Parallel Machines
… purpose subroutine on a distributed memory parallel machine is the data distribution. It is possible that users would like to use the subroutine with different data distributions. Thus there is a need to design algorithms on distributed memory parallel machines which can support a variety of …
-
Multidirectional search: A direct search algorithm for parallel machines
… which exploit the computational power of parallel computer architectures. We have developed a new direct search algorithm, which we call multi-directional search, that is ideally suited for parallel computation. Our algorithm belongs to the class of direct search methods, a class of …
-
Efficient similarity computations on parallel machines using data shaping
… to core counts is decreasing. State-of-the-art parallel computing platforms such as General Purpose Graphics Processors (GPUs) and MICs are promising for high performance as well high throughput computing. However, processing semi-structured component of Big Data efficiently using parallel …
-
Parallel machines scheduling with applications to Internet ad-slot placement
… jobs on identical, uniform and unrelated parallel machines with an objective of achieving an optimal schedule. The primary focus is on the minimization of the maximum completion time of the jobs, commonly referred to as Makespan (C max ). We survey and present examples of uniform machines …
-
Multiple objective scheduling in parallel machines using mem[e]tic algorithm
… the memetic algorithms to solve the identical parallel machine with multiple objective scheduling problems. The two fundamental issues this paper and all other parallel machine scheduling problems have to deal with are job partition among machines and job sequence within each machine. Since …
-
Scheduling jobs on two uniform parallel machines to minimize the makespan
… of scheduling n independent jobs on m uniform parallel machines such that the total completion time is minimized is a NP-Hard problem. We propose several heuristic-based online algorithms for machines with different speeds called Q2||Cmax. To show the efficiency of the proposed online …
-
The implementation of functional languages on parallel machines with distributed memory
Contains fulltext : mmubn000001_220469350.pdf (Publisher’s version ) (Open Access)
-
DOMAIN DECOMPOSITION FOR TWO-DIMENSIONAL ELLIPTIC OPERATORS ON VECTOR AND PARALLEL MACHINES (SUBSTRUCTURING)
… large two-dimensional problems on vector and parallel machines. The convergence of the preconditioned conjugate gradient method is determined by the condition number of the matrix M('-1)A where A and M correspond to the matrix for the discretized differential equation and to the …
-
Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines
Let there be m parallel machines and n jobs to be scheduled non-preemptively. A job j scheduled on machine i takes p_{i,j} time units to complete, where 1 ≤ i ≤ m and 1 ≤ j ≤ n. For a given schedule, the makespan is the completion time of a machine that finishes last. The goal is to produce a …
-
Achieving High Performance on Extremely Large Parallel Machines: Performance Prediction and Load Balancing
… load balancing strategies for petaflops class machines. We explore a novel design of a scalable hierarchical load balancing scheme, which incorporates an explicit memory cost control function to make it easy to adapt to extremely large machines with small memory footprint. This hierarchical …
-
Message-driven parallel language runtime design and optimizations for multicore-based massively parallel machines
… blocks for all current and future massively parallel machines. Much work has been done in scientific and engineering HPC applications to exploit shared-memory multicore nodes. This thesis, in contrast, pays close attention to the parallel language runtime system–a software layer that supports …
-
Least space-time first scheduling algorithm : scheduling complex tasks with hard deadline on parallel machines
Both time constraints and logical correctness are essential to real-time systems and failure to specify and observe a time constraint may result in disaster. Two orthogonal issues arise in the design and analysis of real-time systems: one is the specification of the system, and the semantic model …
Page 1 of 8