Control abstraction is the process by which programmers deene new control constructs, specifying a statement ordering separately from an implementation of that ordering. We argue that control abstraction can and should play a central role in parallel programming. Control abstraction can be used to build new control constructs for the expression of parallelism. A control construct can have sever...

We consider the issue of scalability of graph-based semi-supervised learning (SSL) algorithms. In this context, we propose a fast graph node ordering algorithm that improves (parallel) spatial locality by being cache cognizant. This approach allows for a near linear speedup on a shared-memory parallel machine to be achievable, and thus means that graph-based SSL can scale to very large data set...

We design the rst eecient parallel algorithm for computing the minimal elimination ordering (MEO) of an arbitrary graph. The algorithm works in O(log 3 n) parallel time and O(nm) processors on a CREW PRAM, for an n-vertex, m-edge graph, and is optimal up to a polylogarithmic factor with respect to the best sequential algorithm of Rose, Tarjan and Lueker ((RTL 76]). The MEO problem for arbitrary...

The field of visualization assists data interpretation in many areas, but some types of data are not manageable by existing visualization techniques. This holds in particular for time-varying multichannel EEG data. No existing technique can simultaneously visualize information from all channels in use and all time steps. To address this problem, a new visualization technique is presented, based...

The improving computational speed of workstations makes clusters of these machines attractive for parallel computing. The workstation model of parallel processing, however, presents speciic challenges caused by the latency of the communications network and the workload imbalance that arises from the heterogeneity of the nodes. Because of these issues, data partitioning is critically important f...

Estimating and minimizing the maximum power dissipation during testing is an important task in VLSI circuit realization since the power value affects the reliability of the circuits. Therefore during testing a methodology should be adopted to minimize power consumption. Test patterns generated with –D 1 option of ATALANTA contains don’t care bits (x bits). By suitable filling of don’t cares can...

We describe a number of algorithms for the model for parallel computation called Parallel Alternating-Direction Access Machine (padam). This model has the memory modules of the global memory arranged as a 2-dimensional array, with each processor assigned to a row and a column, the processors can switch synchronously between row and column access modes. We study the issues of inter-processor com...

We present a set of optimal and asymptotically optimal sequential and parallel algorith ms for the problem of searching on an m n sorted matrix m n Our two sequential algo rithms have a time complexity ofO m log n m which is shown to be optimal Our parallel algorithm runs in O log logm log logm log n m z time usingm log logm log logm processors on a COMMON CRCW PRAM where z is a monotonically d...

Distributed Computation has been a recent trend in engineering research. Parallel Computation is widely used in different areas of Data Mining, Image Processing, Simulating Models, Aerodynamics and so forth. One of the major usage of Parallel Processing is widely implemented for clustering the satellite images of size more than dimension of 1000x1000 in a legacy system. This paper mainly focuse...