Filters








1,990 Hits in 4.9 sec

Design of software for distributed/multiprocessor systems

Terrence R. Mckelvey, Dharma P. Agrawal
1982 Proceedings of the June 7-10, 1982, national computer conference on - AFIPS '82  
Petri-nets and precedence graphs are presented as techniques for the modeling of a problem for implementation on a computer system.  ...  These techniques offer a systematic design methodology for the design of distributed/ multiprocessor system software.  ...  Additionally, the three-task approach could be effectively run on a multiprocessor or distributed system.  ... 
doi:10.1145/1500774.1500803 dblp:conf/afips/MckelveyA82 fatcat:k5km7u4i5vggrdgcehfj3alcje

CPR: Composable performance regression for scalable multiprocessor models

Benjamin C. Lee, Jamison Collins, Hong Wang, David Brooks
2008 2008 41st IEEE/ACM International Symposium on Microarchitecture  
Trained with a production quality simulator, CPR is accurate with median errors of 6.63, 4.83 percent for dual-, quad-core multiprocessors.  ...  Uniprocessor and contention model outputs are composed by a penalty model to produce the final multiprocessor performance estimate.  ...  Composable regression is a scalable, efficient approach for constructing these multiprocessor models.  ... 
doi:10.1109/micro.2008.4771797 dblp:conf/micro/LeeCWB08 fatcat:di4kfo7yb5emhnzasj73f4bsoi

A model for an intelligent operating system for executing image understanding tasks on a reconfigurable parallel architecture

C. Henry Chu, Edward J. Delp, Leah H. Jamieson, Howard Jay Siegel, Francis J. Weil, Andrew B. Whinston
1989 Journal of Parallel and Distributed Computing  
This paper presents a conceptual model that explores the potential of artificial intelligence tools, specifically expert systems, to design an Intelligent Operating System for multiprocessor systems.  ...  Parallel processing is one approach to achieving the large computational processing capabilities required by many real-time computing tasks.  ...  INTRODUCTION A new approach to the implementation of image understanding systems on multiprocessor computer architectures is presented.  ... 
doi:10.1016/0743-7315(89)90008-7 fatcat:ubxt56mrdraadhrovj7pwhrlvy

New parallel Hough transform for circles

R. Chan, W.C. Siu
1991 IEE Proceedings E (Computers and Digital Techniques)  
The conventional Hough technique [I, 21 requires a three-dimensional accumulator array (AA) for the detection of circles.  ...  approach on the basis of execution time and recognition rate is presented.  ...  Various parallel realisations of this new scheme have been performed on a general purpose MIMD multiprocessor system which comprises eight T800 transputers and cross-bar switches for network topology reconfiguration  ... 
doi:10.1049/ip-e.1991.0046 fatcat:xk7loecwvfaltmo7eyjv45ctjq

Performance of the Hough transform on a distributed memory multiprocessor

Austin Underhill, Mohammed Atiquzzaman, John Ophel
1999 Microprocessors and microsystems  
The Hough transform is a projection-based transform which can be used to detect shapes in images. One of the disadvantages of the transform is its requirement for large amounts of computing power.  ...  The work reported in this paper compares the performance obtained in running several parallel versions of the Hough transform on a Fujitsu AP1000 distributed memory multiprocessor.  ...  Acknowledgements The authors would like to thank the CAP project at the Australian National University for providing access to the AP1000 machine.  ... 
doi:10.1016/s0141-9331(98)00093-3 fatcat:vgcunsfctvacfbpjgaruhyl2sm

Coarse-to-Fine Search Technique to Detect Circles in Images

M. Atiquzzaman
1999 The International Journal of Advanced Manufacturing Technology  
The results demonstrate that the coarse-to-fine search strategy is very suitable for detecting circles in real-time environments having time constraints.  ...  Straight lines, circles and ellipses are considered to be the basic building blocks of a large number of patterns occurring in real-world images.  ...  The Coarse-to-Fine Approach for Circle Detection In the proposed coarse-to-fine approach for circle detection, the initial iterations are performed on reduced-size images using a coarse resolution accumulator  ... 
doi:10.1007/s001700050045 fatcat:ybofqdqbnzdlppcmzy224onxmm

Fast Hough Transform on Multiprocessors: A Branch and Bound Approach

N. Guil, E.L. Zapata
1997 Journal of Parallel and Distributed Computing  
In this work we approach this algorithm as a branch and bound problem, developing three different parallel algorithms.  ...  The first of these algorithms is based on an initial distribution of the problem that guarantees a good balance of computations.  ...  For example, ellipse and circle detections in the Cray-3TE take 18.00 and 63.75 s, respectively, in one processor.  ... 
doi:10.1006/jpdc.1997.1362 fatcat:5wpn55rwobdtfnfhnbsfupn4pu

Single-level integrity and confidentiality protection for distributed shared memory multiprocessors

Brian Rogers, Chenyu Yan, Siddhartha Chhabra, Milos Prvulovic, Yan Solihin
2008 High-Performance Computer Architecture  
In this work we propose a new and efficient memory encryption and authentication solution for protecting the confidentiality and integrity of data in a DSM system.  ...  Because inter-node communication involves two separate security mechanisms, we refer to this approach as a two-level approach. Such a two-level approach results in a number of inefficiencies.  ...  For example, a global bus counter can be used to encrypt data transfers between processors [21] , or data transmitted on the bus itself can be used to encrypt new data blocks through Cipher Block Chaining  ... 
doi:10.1109/hpca.2008.4658636 dblp:conf/hpca/RogersYCPS08 fatcat:hiv72zl6xfgr5hm7qdkixrpriq

Experimental Evaluation of the Performance of Processing Stealing Technique: A Scalable Load Balancing Technique for a Dynamic Multiprocessor System

O. O.Olakanmi, O. A. Fakolujo
2013 International Journal of Computer Applications  
These traces were used as workloads on two different simulation setups; the first is a dynamic multiprocessor with PE-S while the other was also a dynamic multiprocessor but without PE-S.  ...  The multiprocessor system is imagined as a dynamic cluster based multiprocessor.  ...  A simple algorithm to distribute loads evenly on multiprocessor computers with hypercube interconnection networks was proposed in [10] .  ... 
doi:10.5120/14426-2568 fatcat:njatusmmcndatfuvjkgvj4nhqy

Watchdog processors in parallel systems

András Pataricza, István Majzik, Wolfgang Hohl, Joachim Hönig
1993 Microprocessing and Microprogramming  
A watchdog processor (WDP) is a relatively simple coprocessor built for concurrent, information compaction based error detection in the main program control flow.A new algorithm called SEIS (Signature  ...  Solutions for a fault-tolerant multiprocessing and multitasking implementation are described as well.  ...  The MEMSY Architecture The new experimental multiprocessor MEMSY (Modular Expandable Multiprocessor System) developed at the University of Erlangen-Nuremberg serves both as a test-bed for high performance  ... 
doi:10.1016/0165-6074(93)90059-t fatcat:7gdwi26r3rcchf6juxlswgi6sy

Marker-Less 3D Human Motion Capture in Real-Time Using Particle Swarm Optimization with GPU-Accelerated Fitness Function [chapter]

Bogdan Kwolek, Boguslaw Rymut
2017 Lecture Notes in Computer Science  
CUDA-OpenGL Interoperability General-purpose computation on the GPU (GPGPU) is a term denoting the employment of the GPU for calculations other than rendering.  ...  CUDA is scalable parallel programming model and a parallel programming platform for GPUs.  ...  As one thread blocks terminates, new blocks are launched on the available multiprocessors.  ... 
doi:10.1007/978-3-319-71598-8_38 fatcat:3gftvgu7tfgjhhpzumkzhwv66y

Fast Parallel All-Subgraph Enumeration Using Multicore Machines

Saeed Shahrivari, Saeed Jalili
2015 Scientific Programming  
Subenum enumerates subgraphs using edges instead of vertices, and this approach leads to a parallel and load-balanced enumeration algorithm that can have efficient execution on current multicore and multiprocessor  ...  Enumerating all subgraphs of an input graph is an important task for analyzing complex networks.  ...  We presented a new parallel solution, named Subenum, for the all-subgraph enumeration problem on multicore and multiprocessor systems.  ... 
doi:10.1155/2015/901321 fatcat:xy4vdw24k5g2hhl223xcrl4ddq

Characterizing scalar opportunities in GPGPU applications

Zhongliang Chen, David Kaeli, Norman Rubin
2013 2013 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)  
In this paper, we first characterize a number of CUDA programs taken from the NVIDIA SDK to quantify the potential for scalar execution.  ...  We then evaluate the impact of scalar units on a heterogeneous scalar-vector GPU architecture.  ...  The authors would also like to thank the GPGPU-Sim and Ocelot teams for use of their toolsets.  ... 
doi:10.1109/ispass.2013.6557173 dblp:conf/ispass/ChenKR13 fatcat:ttwlt5v5rzaajavqilbkysfnqm

Satisfiability test with synchronous simulated annealing on the Fujitsu AP1000 massively-parallel multiprocessor

Andrew Sohn, Rupak Biswas
1996 Proceedings of the 10th international conference on Supercomputing - ICS '96  
Experimental results on the APlOOO multiprocessor indicate that our approach can satisfy 99.9% of the clauses while giving almost a 70-fold speedup on 500 processors.  ...  This report presents a parallel synchronous simulated annealing method for solving the Random L-SAT Problem on a large-scale distributed-memory multiprocessor.  ...  ACKNOWLEDGEMENTS The authors would like to thank the Fujitsu Parallel Computing Laboratory for providing access to the APlOOO multiprocessor.  ... 
doi:10.1145/237578.237606 dblp:conf/ics/SohnB96 fatcat:pk2ftt532bewhlfawj6gz5rlka

Cache coherence in large-scale shared-memory multiprocessors: issues and comparisons

David J. Lilja
1993 ACM Computing Surveys  
A wide variety of mechanisms have been proposed for maintaining cache coherence in large-scale shared memory multiprocessors making it difficult to compare their performance and implementation implications  ...  In addition, hybrid strategies are presented that can enhance the performance of the multiprocessor memory system by combining several different coherence mechanisms into a single system.  ...  anonymous referees for their considerable efforts in reviewing the early drafts of this paper.  ... 
doi:10.1145/158439.158907 fatcat:srtajkt5zbaphhfvqxhe4imb6m
« Previous Showing results 1 — 15 out of 1,990 results