Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2012
Hybrid Parallelism for Volume Rendering on Large-, Multi-, and Many-Core Systems
IEEE Transactions on Visualization and Computer Graphics (ITVC), Volume 18, Issue 1January 2012, Pages 17–29https://doi.org/10.1109/TVCG.2011.24With the computing industry trending toward multi- and many-core processors, we study how a standard visualization algorithm, raycasting volume rendering, can benefit from a hybrid parallelism approach. Hybrid parallelism provides the best of both ...
- research-articleJanuary 2012
Triangular Matrix Inversion on Heterogeneous Multicore Systems
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 23, Issue 1January 2012, Pages 177–184https://doi.org/10.1109/TPDS.2011.103Dense matrix inversion is a basic procedure in many linear algebra algorithms. Any factorization-based dense matrix inversion algorithm involves the inversion of one or two triangular matrices. In this work, we present an improved implementation of a ...
- research-articleJuly 2010
Illustrative Volume Visualization Using GPU-Based Particle Systems
IEEE Transactions on Visualization and Computer Graphics (ITVC), Volume 16, Issue 4July 2010, Pages 571–582https://doi.org/10.1109/TVCG.2010.32Illustrative techniques are generally applied to produce stylized renderings. Various illustrative styles have been applied to volumetric data sets, producing clearer images and effectively conveying visual information. We adopt particle systems to ...
- articleApril 2009
Parallel Clustering Algorithm for Large Data Sets with Applications in Bioinformatics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), Volume 6, Issue 2Pages 344–352https://doi.org/10.1109/TCBB.2007.70272Large sets of bioinformatical data provide a challenge in time consumption while solving the cluster identification problem, and that is why a parallel algorithm is so needed for identifying dense clusters in a noisy background. Our algorithm works on a ...
- research-articleMarch 2007
Double Point Compression with Applications to Speeding Up Random Point Multiplication
IEEE Transactions on Computers (ITCO), Volume 56, Issue 3March 2007, Pages 305–313https://doi.org/10.1109/TC.2007.47This paper presents two main results relating to elliptic curve cryptography. First, a double point compression scheme is proposed which allows a compact representation of elliptic curve points without the computational cost associated with ordinary ...
-
- articleJanuary 2005
Speeding-up normalized neural networks for face/object detection
Machine Graphics & Vision International Journal (MGVIJ), Volume 14, Issue 1January 2005, Pages 29–59Finding an object or a face in an input image is a search problem in the spatial domain. Neural networks have shown good results in detecting a certain face/object in a given image. In this paper, faster neural networks for face/object detection are ...
- research-articleSeptember 2004
An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 15, Issue 9September 2004, Pages 824–834https://doi.org/10.1109/TPDS.2004.38We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiprocessor systems. Our approach requires minimal problem specific information and no problem specific operators or repair mechanisms. Key features of our ...
- research-articleSeptember 2004
A Super-Programming Approach for Mining Association Rules in Parallel on PC Clusters
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 15, Issue 9September 2004, Pages 783–794https://doi.org/10.1109/TPDS.2004.37PC clusters have become popular in parallel processing. They do not involve specialized interprocessor networks, so the latency of data communications is rather long. The programming models for PC clusters are often different than those for parallel ...
- research-articleAugust 2003
Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 14, Issue 8August 2003, Pages 780–794https://doi.org/10.1109/TPDS.2003.1225057Network-based parallel computing systems often require the ability to reconfigure the routing algorithm to reflect changes in network topology if and when voluntary or involuntary changes occur. The process of reconfiguring a network's routing ...
- research-articleMarch 2003
A Progressive Approach to Handling Message-Dependent Deadlock in Parallel Computer Systems
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 14, Issue 3March 2003, Pages 259–275https://doi.org/10.1109/TPDS.2003.1189584Handling deadlocks is essential for providing reliable communication paths between processing nodes in parallel computer systems. The existence of multiple message types and associated intermessage dependencies may cause message-dependent deadlocks in ...
- research-articleAugust 2002
Predicting the Cost and Benefit of Adapting Data Parallel Applications in Clusters
Journal of Parallel and Distributed Computing (JPDC), Volume 62, Issue 8August 2002, Pages 1248–1271https://doi.org/10.1006/jpdc.2002.1838This paper examines the problem of adapting data parallel applications in a shared dynamic environment of PC or workstation clusters. We developed an analytic framework to compare and contrast a wide range of adaptation strategies: dynamic load ...
- research-articleJuly 2002
Fault-Tolerant Recursive Least-Squares Computations on a Mesh-Connected Parallel Processor
Journal of Parallel and Distributed Computing (JPDC), Volume 62, Issue 7July 2002, Pages 1142–1167https://doi.org/10.1006/jpdc.2002.1840Recursive least squares (RLS) is a popular iterative method used for the modeling of systems while in operation. RLS provides an estimate for unknown parameters of a system based on some known parameters and inputs and outputs of that system. This ...
- ArticleJune 1999
Powerful and Feasible Processor Interconnections With an Evaluation of Their Communications Capabilities
ISPAN '99: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and NetworksJune 1999, Page 222Scalable networks with very good topological properties are often impossible to build because of their prohibitively high wiring complexity. Such a network is the generalized hypercube (GH). It supports full-connectivity of all its nodes in each ...
- ArticleFebruary 1999
New Algorithms for Efficient Mining of Association Rules
FRONTIERS '99: Proceedings of the The 7th Symposium on the Frontiers of Massively Parallel ComputationFebruary 1999, Page 234Discovery of association rules is an important data mining task. Several algorithms have been proposed to solve this problem. Most of them require repeated passes over the database, which incurs huge I/O overhead and high synchronization expense in ...
- research-articleJuly 1998
Embedding Torus on the Star Graph
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 9, Issue 7July 1998, Pages 650–663https://doi.org/10.1109/71.707542In this paper, we present a scheme for efficient embedding of torus of any dimension on a star graph. The dilation of the embedding is four. The expansion is small. Congestion depends upon the routing scheme used. With one routing scheme, the congestion ...
- research-articleNovember 1997
Generating an Efficient Broadcast Sequence Using Reflected Gray Codes
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 8, Issue 11November 1997, Pages 1117–1122https://doi.org/10.1109/71.642946One-to-all broadcast is frequently implemented on multicomputers using a binomial tree communication pattern. The source processor, at the root of the broadcast tree, completes the broadcast before the processors at the leaves of the tree. This ...
- ArticleOctober 1996
Average Distance and Routing Algorithms in the Star-Connected Cycles Interconnection Network
SPDP '96: Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)October 1996, Page 443The star-connected cycles (SCC) graph was recently proposed as an attractive interconnection network for parallel processing, using a star graph to connect cycles of nodes. This paper presents an analytical solution for the problem of the average ...
- ArticleOctober 1996
Load-Balancing in Sparse Matrix-Vector Multiplication
SPDP '96: Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)October 1996, Page 218We considered the load-balanced multiplication of a large sparse matrix with a large sequence of vectors, on parallel computers. Due to the associated computational and inter-node communication challenges, we propose a method that combines fast load-...
- research-articleOctober 1995
Characterizing the Performance of Algorithms for Lock-Free Objects
IEEE Transactions on Computers (ITCO), Volume 44, Issue 10October 1995, Pages 1194–1207https://doi.org/10.1109/12.467694Concurrent access to shared data objects must be regulated by a concurrency control protocol to ensure correctness. Many concurrency control protocols require that a process set a lock on the data it accesses. Recently, there has been considerable ...
- research-articleSeptember 1995
A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes
IEEE Transactions on Computers (ITCO), Volume 44, Issue 9September 1995, Pages 1162–1167https://doi.org/10.1109/12.464397We study the multicast problem in hypercubes with faulty nodes. We assume that each node has limited global information of fault distribution, which is captured by the safety level associated with the node. Basically, the safety level is an approximate ...