189,928 Hits in 4.2 sec

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.  ...  Many big data computations involve processing data that changes incrementally or dynamically over time. Using existing techniques, such computations quickly become impractical.  ...  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 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 present an overview of our ongoing work on parallelizing self-adjusting-computation techniques.  ...  We describe techniques for writing parallel self-adjusting programs and a change propagation algorithm that can update computations in parallel.  ...  CONCLUSION This paper describes techniques for parallel self-adjusting computation. We describe a language PAL with a fork-based parallelism primitive for writing parallel self-adjusting programs.  ... 
doi:10.1145/1248648.1248651 dblp:conf/popl/HammerARG07 fatcat:sqaypue2wnatvkd642gmiq7eja

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.  ...  Our algorithm allows insertion and/or deletion of both vertices and edges anywhere in the input and performs updates in parallel.  ...  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

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  ...  Introduction Parallel computers are increasingly widespread, and nowadays, many of these parallel computers are no longer shared-memory multiprocessors, but follow the distributed memory model due to scalability  ... 
doi:10.1007/978-3-540-30141-7_15 fatcat:442irovgs5haxmdxm6cu3o273y

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  
strategy on the servo parameters optimization algorithm (ALBPO) to improve the computing precision and to achieve high detection ratio while not reducing the servo circle.  ...  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  ...  An efficient parallel algorithm should enable the load to achieve balance, evenly distribute tasks, and minimize the amount of communication between nodes and thus improving the performance of the parallel  ... 
doi:10.1155/2013/978548 pmid:24174920 pmcid:PMC3794567 fatcat:lufr2oezpzep3cieqlkduyjnxm

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  
Efficient loop scheduling on parallel and distributed systems depends mostly on load balancing, especially on heterogeneous PC-based cluster and grid computing environments.  ...  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.  ...  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

Page 4498 of Mathematical Reviews Vol. , Issue 97G [page]

1997 Mathematical Reviews  
Algorithms 15 (1993), no. 3, 447-481], we designed and analyzed efficient self-adjusting linear list algorithms.  ...  Under certain conditions, a downwards pass is both ‘efficient’ (computable in a functional style in parallel time proportional to the depth of the tree) and ‘manipulable’ (enjoying a number of distributivity  ... 

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  ...  That is, understanding how to map various parts of parallel coding to computing resources in order to minimize overall computing time and make efficient use of these resources.  ... 
doi:10.1016/j.parco.2007.01.003 fatcat:iat4rnhpgfcnhjwgbz4g5tjxve

Policy-based techniques for self-managing parallel applications

2006 Knowledge engineering review (Print)  
This paper presents an empirical investigation of policy-based self-management techniques for parallel applications executing in loosely-coupled environments.  ...  A prototype self-managing parallel application is used as a vehicle to explore the feasibility and benefits of the strategy. In particular, several aspects of stability are investigated.  ...  Policy-based techniques for self-managing parallel applications 4 A self-managing parallel application To demonstrate the feasibility of the strategy, a self-managing parallel application has been developed  ... 
doi:10.1017/s0269888906000890 fatcat:qxs2jpaaorapvixdbrl3kwkojy

Type-directed automatic incrementalization

Yan Chen, Jana Dunfield, Umut A. Acar
2012 Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12  
Based on recent advances in self-adjusting computation, including a theoretical proposal for translating purely functional programs to self-adjusting programs, we develop techniques for translating conventional  ...  Since incremental changes to input often result in only small changes in output, it is often feasible to respond to such changes asymptotically more efficiently than by re-running the whole computation  ...  Writing self-adjusting matrix-multiply. Self-adjusting computation offers a way to write efficient incremental algorithms by modifying the code for the standard, non-incremental algorithm.  ... 
doi:10.1145/2254064.2254100 dblp:conf/pldi/ChenDA12 fatcat:e7yw3prks5ffxfyojxjlb6ymwy

Editorial: communication optimization for scalable parallel system

Ching-Hsien Hsu, Peter Sloot
2012 Journal of Supercomputing  
The six papers included in this special issue demonstrate the effectiveness and efficiency of a variety of technologies and applications in scalable parallel systems.  ...  All of them not only contribute valuable insights and results but also have particular relevance to the parallel computing community.  ...  for parallel computing.  ... 
doi:10.1007/s11227-012-0744-3 fatcat:fqagtnmyjvg65fq54n5kw4iaf4

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.  ...  We describe programming techniques that proved particularly useful to improve the performance of self-adjustment in practice.  ...  Parallel Self-Adjusting Computation Several recent papers have proposed parallel self-adjusting algorithms for specific problems [7, 11, 12, 35] .  ... 
doi:10.1145/2048066.2048101 dblp:conf/oopsla/BurckhardtLSYB11 fatcat:vutsiid3ebc7hgcgqe62n5rvr4

An Efficient Algorithm for finding Optimal Spans to determine R=1/2 Rate Systematic Convolutional Self-Doubly Orthogonal Codes
R=1/2 Self-Doubly 조직 직교 길쌈부호를 찾는 효율적인 최적 스팬 알고리듬

Atabaev Doniyor, Hee-Jong Suh
2015 The Journal of the Korea institute of electronic communication sciences  
This new algorithm based on Parallel Implicitly-Exhaustive search, where we applied dynamic search space reduction methods in order to reduce computational time for finding Optimal Span for R=1/2 rate  ...  In this paper, a new method for finding optimal and short span in Convolutional Self-Doubly Orthogonal(CDO) codes are proposed.  ...  Convolutional Self-Doubly Orthogonal(: CDO) codes used to increase efficiency and build high-performance, low latency codes [1] for data transmission in communication channels.  ... 
doi:10.13067/jkiecs.2015.10.11.1239 fatcat:7pa4rtcv2rgx5hd6ujrxrkfzom

Page 3190 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
|Balasubramanian, Ramachandran] (6-MATSCI; Madras); Raman, Venkatesh (6-MATSCI; Madras) Path balance heuristic for self-adjusting binary search trees.  ...  Sleator suggested the following heuristic for self-adjusting binary search trees: every time an access is made, restructure the entire path from the root of the search tree to the accessed node into a  ... 

Using runtime measured workload characteristics in parallel processor scheduling [chapter]

Thu D. Nguyen, Raj Vaswani, John Zahorjan
1996 Lecture Notes in Computer Science  
We consider the use of runtime measured workload characteristics in parallel processor scheduling.  ...  In contrast, we propose and evaluate experimentally dynamic processor allocation policies that rely on determining job characteristics at runtime; in particular, we focus on measuring and using job efficiency  ...  Both kinds of computing already have significant roles on existing large scale parallel platforms [7] .  ... 
doi:10.1007/bfb0022293 fatcat:qtkl2t2c4zctzkc237cvcuu2wu
« Previous Showing results 1 — 15 out of 189,928 results