Filters








13,027 Hits in 4.9 sec

Communication optimizations for fine-grained UPC applications

Wei-Yu Chen, C. Iancu, K. Yelick
2005 14th International Conference on Parallel Architectures and Compilation Techniques (PACT'05)  
In this paper we present three optimization techniques for global address space programs with fine-grained communication: redundancy elimination, use of split-phase communication, and communication coalescing  ...  By separating the initiation of a remote memory access as far away as possible from its completion, its latency can be hidden through the overlapping of communication and computation as well as message  ...  Redundancy elimination may also be used to avoid some of the bookkeeping overhead of a shared address space. • Message coalescing: Coalescing small puts and gets into large messages can be a valuable optimization  ... 
doi:10.1109/pact.2005.13 dblp:conf/IEEEpact/ChenIY05 fatcat:d36dl2nkyzcpthtp5sxjlzuyv4

Simplifying control flow in compiler-generated parallel code [chapter]

John Mellor-Crummey, Vikram Adve
1998 Lecture Notes in Computer Science  
Here we describe a pair of algorithms that compute symbolic constraints on values of integer variables and use them to remove such unnecessary conditional control ow.  ...  Finally, we describe a synergy between control ow simpli cation and code generation based on loop splitting that achieves the e ects of more narrow optimizations such as vector message pipelining and the  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as representing the o cial policies or endorsements, either expressed or implied, of the Defense Advanced  ... 
doi:10.1007/bfb0032695 fatcat:4zmhac63g5chflz6uf6dkc6xby

Performance Analysis of Broadcast in Multi-channel Multi-radio Wireless Mesh Networks [chapter]

Min Song, Xiaohua Xu
2013 Lecture Notes in Computer Science  
In this work, we analyze the performance of a broadcast protocol with MAC-layer scheduling under different networking conditions.  ...  We also explore the performance improvement by incoporating the neighbor elimination scheme with the broadcast protocol.  ...  a probability of p and drops the message with a probability of 1 − p.  ... 
doi:10.1007/978-3-642-39701-1_10 fatcat:fgqbfgoihvcbznmuvfet54wb5y

The Thin Plate Spline warping based Image Morphing algorithm is the best choice

S. Gunasekaran, I. Vasudevan
2014 International Journal of Computer Applications Technology and Research  
labeled data with a great quantity of unlabeled data.  ...  A feature selection algorithm may be appraised from both the good organization and usefulness points of view.  ...  Affinity Propagation Algorithm The affinity propagation (AP) is a clustering algorithm established on the notion of "message passing" among data points.  ... 
doi:10.7753/ijcatr0311.1011 fatcat:gy6kc4yghfd33cmtefhekkbyfm

Domain independent redundancy elimination based on flow vectors for static video summarization

Jesna Mohan, Madhu S. Nair
2019 Heliyon  
This paper presents a novel domain-independent method for redundancy elimination from input videos before summarization maintaining keyframes in the original video.  ...  The method also gives superior results compared to other state-of-the-art redundancy elimination methods for video summarization.  ...  The algorithm works by passing messages between nodes of graph. The nodes are four neighbors of pixel under consideration. Each message has dimension same as number of possible states of flow vector.  ... 
doi:10.1016/j.heliyon.2019.e02699 pmid:31720461 pmcid:PMC6838871 fatcat:misk4hudpbac5iop5nk2kgyrxu

Proficient Pattern Selection for Supervised Tagging

A.P.V. Raghavendra, I. Vasudevan, M. SenthilKumar
2016 International Journal Of Engineering And Computer Science  
A pattern selection algorithm may be appraised from both the good organization and usefulness points of view.  ...  Although the good organization concerns the time necessary to discover a subsection of pattern, the usefulness is related to the excellence of the subsection of features.  ...  Affinity Propagation Algorithm The affinity propagation (AP) is a clustering algorithm established on the notion of "message passing" among data points.  ... 
doi:10.18535/ijecs/v4i12.11 fatcat:6lcfmovlfrcollcssfpxkjrtwq

Hybrid dynamic data race detection

Robert O'Callahan, Jong-Deok Choi
2003 Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '03  
to discard redundant information, and by using a "two phase" approach to identify error-prone program points and then focus instrumentation on those points.  ...  We justify our claims by presenting the results of applying our tool to a range of Java programs, including the widely-used Web application servers Resin and Apache Tomcat.  ...  minimum hitting set problem, Darko Marinov for helpful comments on the paper, and Mark Christiaens and Christof von Praun for helping us find benchmark programs and for sharing their results and insights with  ... 
doi:10.1145/781498.781528 dblp:conf/ppopp/OCallahanC03 fatcat:aiillvjvzfazhbmbi5735k4jx4

Hybrid dynamic data race detection

Robert O'Callahan, Jong-Deok Choi
2003 SIGPLAN notices  
to discard redundant information, and by using a "two phase" approach to identify error-prone program points and then focus instrumentation on those points.  ...  We justify our claims by presenting the results of applying our tool to a range of Java programs, including the widely-used Web application servers Resin and Apache Tomcat.  ...  minimum hitting set problem, Darko Marinov for helpful comments on the paper, and Mark Christiaens and Christof von Praun for helping us find benchmark programs and for sharing their results and insights with  ... 
doi:10.1145/966049.781528 fatcat:kmoixegv3nfi7lt7fli35si7zq

Hybrid dynamic data race detection

Robert O'Callahan, Jong-Deok Choi
2003 Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '03  
to discard redundant information, and by using a "two phase" approach to identify error-prone program points and then focus instrumentation on those points.  ...  We justify our claims by presenting the results of applying our tool to a range of Java programs, including the widely-used Web application servers Resin and Apache Tomcat.  ...  minimum hitting set problem, Darko Marinov for helpful comments on the paper, and Mark Christiaens and Christof von Praun for helping us find benchmark programs and for sharing their results and insights with  ... 
doi:10.1145/781527.781528 fatcat:2r5riqot5zeejkpwybqd62m3zi

Muller C-element based Decoder (MCD): A decoder against transient faults

Yangyang Tang, Emmanuel Boutillon, Chris Winstead, Christophe Jego, Michel Jezequel
2013 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013)  
We further consider application of MCD to a general-purpose fault-tolerant model, coded Dual Modular Redundancy (cDMR), which offers low-redundancy error-resilience for contemporary logic systems as well  ...  The error-correction analysis of MCD architecture and the investigation of C-element's robustness are first introduced.  ...  Traditionally, there are two versions of the algorithm. When b =(d v −1), all local incoming messages are required to be unanimous, the method is known as the Gallager-A algorithm.  ... 
doi:10.1109/iscas.2013.6572187 dblp:conf/iscas/TangBWJJ13 fatcat:ij7gdhvw7zb3vpmq4incjn6xfi

Minimizing data and synchronization costs in one-way communication

M. Kandemir, A. Choudhary, P. Banerjee, J. Ramanujam, N. Shenoy
2000 IEEE Transactions on Parallel and Distributed Systems  
Our approach works with the most general data alignments and distributions in languages like HPF, and is more powerful than other current solutions for eliminating redundant synchronization messages.  ...  In this paper, we present a general technique which uses a global dataflow framework to optimize communication and synchronization in the context of the oneway communication model.  ...  Summary We presented dataflow algorithms to reduce number of data messages, communication volume and number of synchronization messages.  ... 
doi:10.1109/71.895791 fatcat:aznbamsihne65krycbou25tr34

Efficient and effective array bound checking

Thi Viet Nga Nguyen, François Irigoin
2005 ACM Transactions on Programming Languages and Systems  
This article presents two optimization techniques that deal with Points 1, 2, and 3, and a new algorithm to tackle Point 4, which is not addressed by the current literature.  ...  The first optimization technique is based on the elimination of redundant tests, to provide very accurate information about faulty references during development and testing phases.  ...  Coelho for implementing some key algorithms in PIPS, as well as C. Ancourt, P. Jouvelot, and R. Keryell for their collaborations. We also wish to give special thanks to S. Algarotti, C.  ... 
doi:10.1145/1065887.1065893 fatcat:a56bjkhc3jfvdestauktbazlge

Parallel Redundancy Protocol for Railway Wireless Data Communication Network

Kaifeng Wang, Hui Li, Qi Zhang, Li Zhu
2022 Wireless Communications and Mobile Computing  
At the same time, according to the requirements of the receiving entity for redundant data elimination, an improved Bloom filter is proposed.  ...  In order to solve the problem that the railway application services have strict requirements on the reliability, delay, and other indicators of mobile data communication, a parallel redundancy protocol  ...  Therefore, the performance of eliminating redundant data is tested and analyzed. The redundant data elimination time is tested in a static environment.  ... 
doi:10.1155/2022/3312569 fatcat:voptsjirlfembcuvbekw3qtdq4

Compiler-Optimized Simulation of Large-Scale Applications on High Performance Architectures

Vikram S Adve, Rajive Bagrodia, Ewa Deelman, Rizos Sakellariou
2002 Journal of Parallel and Distributed Computing  
In this paper, we propose and evaluate practical, automatic techniques that exploit compiler analysis to facilitate simulation of very large message-passing systems.  ...  These dramatic savings allow us to simulate regular message-passing programs on systems and problem sizes 10 to 100 times larger than is possible with the original simulator, or other current state-of-the-art  ...  This work was performed while Adve and Sakellariou were with the Computer Science Department at Rice University and Deelman with the Computer Science Department at UCLA.  ... 
doi:10.1006/jpdc.2001.1800 fatcat:ak4jasypyvflzn2ayae6rmj5s4

A Pub/Sub Message Distribution Architecture for Disruption Tolerant Networks

Sergio CARRILHO, Hiroshi ESAKI
2009 IEICE transactions on information and systems  
The Hikari system does not use node identifiers for message forwarding thus eliminating the complexity of routing associated with many forwarding schemes in DTN.  ...  We have shown that Hikari achieves a superior deliver rate while keeping redundant messages in the system low, which is ideal when using devices with limited resources for message dissemination.  ...  We consider two features that contribute to eliminate redundancy and loops in the system: Time To Live (TTL): Messages have a TTL counter that represents the lifetime of the message.  ... 
doi:10.1587/transinf.e92.d.1888 fatcat:voad5crehvbgdgpp2xsggq44nm
« Previous Showing results 1 — 15 out of 13,027 results