Filters








217,982 Hits in 4.2 sec

A proposal for parallel self-adjusting computation

Matthew Hammer, Umut A. Acar, Mohan Rajagopalan, Anwar Ghuloum
2007 Proceedings of the 2007 workshop on Declarative aspects of multicore architectures - DAMP '07  
We describe techniques for writing parallel self-adjusting programs and a change propagation algorithm that can update computations in parallel.  ...  All previously proposed self-adjusting computation techniques assume a sequential execution model.  ...  This paper describes a proposal for parallelizing self-adjusting computation techniques and presents some preliminary results.  ... 
doi:10.1145/1248648.1248651 dblp:conf/popl/HammerARG07 fatcat:sqaypue2wnatvkd642gmiq7eja

Machine Learning-Based Self-Adjusting Concurrency in Software Transactional Memory Systems

Diego Rughetti, Pierangelo Di Sanzo, Bruno Ciciani, Francesco Quaglia
2012 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems  
Software Transactional Memories (STM) are a promising paradigm for parallel programming on multicore platforms.  ...  The experimental data confirm how our self-adjusting concurrency scheme constantly provides optimal performance, thus avoiding performance loss phases caused by non-suited selection of the amount of concurrent  ...  This trend has lead to a growing need for the development of applications which can effectively exploit parallelism, thus bringing parallel programming out from the niche of scientific and high-performance  ... 
doi:10.1109/mascots.2012.40 dblp:conf/mascots/RughettiSCQ12 fatcat:4rgm3f37tzg5zdudspbkrsctxm

Towards adaptive GPU resource management for embedded real-time systems

Junsung Kim, Ragunathan (Raj) Rajkumar, Shinpei Kato
2013 ACM SIGBED Review  
parallel heterogeneous computing.  ...  An implicit adjustment will be supported by a run-time framwork, which dynamically allocates the number of cores to tasks based on the total workload.  ...  Given their highly data-parallel and compute-intensive workloads, parallel computing is a useful solution. As technology stands today, the GPU is the most well-suited platform.  ... 
doi:10.1145/2492385.2492387 fatcat:xhdgy6cohff4tehykp3xbfcfra

Streaming big data with self-adjusting computation

Umut A. Acar, Yan Chen
2013 Proceedings of the 2013 workshop on Data driven functional programming - DDFP '13  
In this paper, we propose an approach based on self-adjusting computation that can dramatically improve the efficiency of such computations.  ...  For example, computing the frequency of words in the first ten thousand paragraphs of a publicly available Wikipedia data set in a streaming fashion using MapReduce can take as much as a full day.  ...  Techniques for parallel self-adjusting computation have also been proposed [Hammer et al. 2007; Burckhardt et al. 2011 ]. Systems.  ... 
doi:10.1145/2429376.2429382 dblp:conf/popl/AcarC12 fatcat:bfufhf354zchjaalfnfoym6wk4

A Self-Adaptive Parameter Optimization Algorithm in a Real-Time Parallel Image Processing System

Ge Li, Xuehe Zhang, Jie Zhao, Hongli Zhang, Jianwei Ye, Weizhe Zhang
2013 The Scientific World Journal  
We use load capacity functions (LC) to estimate the load for each processor and then make continuous self-adaptation towards a balanced status based on the fluctuatedLCresults; meanwhile, we pick up a  ...  Aiming at the stalemate that precision, speed, robustness, and other parameters constrain each other in the parallel processed vision servo system, this paper proposed an adaptive load capacity balance  ...  Conclusions The current study proposed a multiprocessor parallel scheduling algorithm to adjust the performance parameters of the image processing of the visual servo system.  ... 
doi:10.1155/2013/978548 pmid:24174920 pmcid:PMC3794567 fatcat:lufr2oezpzep3cieqlkduyjnxm

An Efficient Parallel Loop Self-scheduling on Grid Environments [chapter]

Chao-Tung Yang, Kuan-Wei Cheng, Kuan-Ching Li
2004 Lecture Notes in Computer Science  
Self-scheduling schemes, which are suitable for parallel loops with independent iterations on cluster computer system, they have been designed in the past.  ...  In this paper, we propose a new scheme that can adjust the scheduling parameter dynamically on an extremely heterogeneous PCbased cluster and grid computing environments in order to improve system performance  ...  In this paper, we propose a new scheme that can adjust the scheduling parameter dynamically on an extremely heterogeneous PC-based cluster and grid computing environments in order to improve system performance  ... 
doi:10.1007/978-3-540-30141-7_15 fatcat:442irovgs5haxmdxm6cu3o273y

A Dynamic Partitioning Self-scheduling Scheme for Parallel Loops on Heterogeneous Clusters [chapter]

Chao-Tung Yang, Wen-Chung Shih, Shian-Shyong Tseng
2006 Lecture Notes in Computer Science  
In this paper, we propose a performance-based scheme, which dynamically partitions loop iterations according to the performance ratio of cluster nodes.  ...  Loop partitioning on parallel and distributed systems has been an important problem. Furthermore, it becomes more difficult to deal with on the emerging heterogeneous PC cluster environments.  ...  Previous researchers [3, 6, 7 ] propose a two-phased self-scheduling approach, which is applicable to PC-based cluster environments.  ... 
doi:10.1007/11758501_111 fatcat:l5a6bknd6vfdbfwdeyxqdg4xwu

Brief Announcement

Umut A. Acar, Vitaly Aksenov, Sam Westrick
2017 Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA '17  
In this paper, we present our ongoing work on designing a parallel algorithm for the dynamic trees problem, which requires computing a property of a forest as the forest undergoes changes.  ...  Dynamic algorithms are used to compute a property of some data while the data undergoes changes over time. Many dynamic algorithms have been proposed but nearly all are sequential.  ...  Self-Adjusting Computation. Our approach is based on the technique of self-adjusting computation for dynamizing static algorithms [1, 2, 23, 27] .  ... 
doi:10.1145/3087556.3087595 dblp:conf/spaa/AcarAW17 fatcat:rj26qivnjfgilc6np2n2mnecji

On development of an efficient parallel loop self-scheduling for grid computing environments

Chao-Tung Yang, Kuan-Wei Cheng, Wen-Chung Shih
2007 Parallel Computing  
Self-scheduling schemes, which are suitable for parallel loops with independent iterations on cluster computer system, they have been designed in the past.  ...  In this paper, we propose a new scheme that can adjust the scheduling parameter dynamically on an extremely heterogeneous PC-based cluster and Grid computing environments in order to improve system performance  ...  We propose a heuristic approach based upon a-based self-scheduling scheme to solve parallel regular loop scheduling problem on an extremely heterogeneous Grid computing environment.  ... 
doi:10.1016/j.parco.2007.01.003 fatcat:iat4rnhpgfcnhjwgbz4g5tjxve

A Performance-Based Parallel Loop Self-scheduling on Grid Computing Environments [chapter]

Wen-Chung Shih, Chao-Tung Yang, Shian-Shyong Tseng
2005 Lecture Notes in Computer Science  
In this paper, a general approach, named Performance-Based Parallel Loop Self-Scheduling (PPLSS), was given to partition workload according to performance of grid nodes.  ...  Efficient loop scheduling on parallel and distributed systems depends mostly on load balancing, especially on heterogeneous PC-based cluster and grid computing environments.  ...  Introduction A promising approach to parallel computing is grid computing, which utilizes heterogeneous computers through the Internet to compute [2, 5, 6] .  ... 
doi:10.1007/11577188_7 fatcat:3xvq6cj3wreqlcsypbwo3lhom4

Two for the price of one

Sebastian Burckhardt, Daan Leijen, Caitlin Sadowski, Jaeheon Yi, Thomas Ball
2011 Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications - OOPSLA '11  
We show in this work that the same abstractions can enable both parallel and incremental execution. We present a novel algorithm for parallel self-adjusting computation.  ...  This algorithm extends a deterministic parallel programming model (concurrent revisions) with support for recording and repeating computations.  ...  Acknowledgments We thank Dan Grossman and Manuel Fähndrich for helpful comments and discussions.  ... 
doi:10.1145/2048066.2048101 dblp:conf/oopsla/BurckhardtLSYB11 fatcat:vutsiid3ebc7hgcgqe62n5rvr4

Applying Autonomic Computing Concepts To Parallel Computing Using Intelligent Agents

Blesson Varghese, Gerard T. McKee
2009 Zenodo  
on a parallel computing core is considered as a swarm of autonomous agents.  ...  The feasibility of the proposed swarm-array computing approach is validated on a multi-agent simulator.  ...  and self-adjusting  ... 
doi:10.5281/zenodo.1330891 fatcat:tqi2antktngm5ahvxrpcgarvry

ParaGro: a learning algorithm for growing parallel self-organizing maps with any input/output dimensions

Iren Valova, Natacha Gueorguieva, Matthias Kempka
2005 International Journal of General Systems  
Self-organizing maps (SOM) have become popular for tasks in data visualization, pattern classification or natural language processing and can be seen as one of the major contemporary concepts for artificial  ...  We present a SOM that processes the whole input in parallel and organizes itself over time.  ...  Self-organizing maps (SOM) have become popular for tasks in data visualization, pattern classification or natural language processing and can be seen as one of the major contemporary concepts for artificial  ... 
doi:10.1080/03081070500422919 fatcat:2hrryuswt5cxfi3dysouhtuaxm

INR: A Programming Model for Developing APPs of Insect Intelligent Building

Shuo Zhao, Qiliang Yang, Jianchun Xing, Qizhen Zhou, Guangtong Xue, Wenjie Chen
2020 Scientific Programming  
To deal with the challenges and provide meaningful guidance for describing and developing I2B APP and motivating the prospective programming language design, we propose INR, a programming model for I2B  ...  Insect Intelligent Building (I2B) is a novel platform of intelligent buildings. The outstanding feature of I2B is the decentralized network structure connected by smart nodes.  ...  Air_sub is a subregion of Air, which is used to manage the network computing activity A for adjusting the air valve opening.  ... 
doi:10.1155/2020/3659849 fatcat:rdrdiyw3xfe63p3kpsnbomcupm

On the Run-Time Dynamics of a Peer-to-Peer Evolutionary Algorithm [chapter]

Juan L. J. Laredo, Agoston E. Eiben, Maarten van Steen, Juan J. Merelo
2008 Lecture Notes in Computer Science  
In order to keep it stable, we propose a self-adjusting mechanism which has been shown successful in three different search landscapes.  ...  As an improvement, we propose a completely asynchronous EA which does not need waiting times.  ...  Our proposal focuses on the following improvements over the work presented in [12] : 1. We propose a self-adjusting mechanism able to keep the population size stable in different search landscapes.  ... 
doi:10.1007/978-3-540-87700-4_24 fatcat:p6w5o4n3abak7ggqpru2j2ucem
« Previous Showing results 1 — 15 out of 217,982 results