Filters








73 Hits in 3.1 sec

Progressive Conversion from B-rep to BSP for Streaming Geometric Modeling

Chandrajit Bajaj, Alberto Paoluzzi, Giorgio Scorzelli
2006 Computer-Aided Design and Applications  
A solid model is so generated at progressive levels of detail.  ...  Our new algorithm is embedded in a streamlined computational framework using four types of dataflow processes, that continuously produce, transform, combine or consume subsets of cells depending on the  ...  The algorithm may be used for importing geometric models into a dataflow (streaming) pipeline to be used for shape modeling of complicated geometries.  ... 
doi:10.1080/16864360.2006.10738411 pmid:21499445 pmcid:PMC3077047 fatcat:wv3krq47kneubituzoxw62uo7a

Reproducible Evaluation of System Efficiency with a Model of Architecture: From Theory to Practice

Maxime Pelcat, Alexandre Mercat, Karol Desnos, Luca Maggiani, Yanzhou Liu, Julien Heulot, Jean-Francois Nezan, Wassim Hamidouche, Daniel Menard, Shuvra S. Bhattacharyya
2017 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
LSLA is then used to model the energy consumption of a State-of-the-Art Multiprocessor System-on-Chip (MPSoC) when running an application described using the Synchronous Dataflow (SDF) MoC.  ...  Current trends in high performance and embedded computing include design of increasingly complex hardware architectures with high parallelism, heterogeneous processing elements and non-uniform communication  ...  The LSLA MoA discussed in this paper is demonstrated with both dataflow MoCs and the Bulk Synchronous Parallel (BSP) MoC for their capacity to represent parallel computation.  ... 
doi:10.1109/tcad.2017.2774822 fatcat:3o7p7pfwazhpvfzycvyruz4a64

PROTO-PLASM: parallel language for adaptive and scalable modelling of biosystems

C. Bajaj, A. DiCarlo, A. Paoluzzi
2008 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
Conversely, CellML and SBML could be viewed as defining the behavioural functions (the model equations) to be used within a PROTO-PLASM program.  ...  PROTO-PLASM may define the model equations, but it is currently focused on the symbolic description of model geometry and on the parallel support of simulations.  ...  The anonymous reviewers are heartily thanked for their remarks, which greatly helped us improve our paper.  ... 
doi:10.1098/rsta.2008.0076 pmid:18559320 pmcid:PMC3342764 fatcat:tqfuzid77jfvfkszfgkkxei5xq

From Conditional Independence to Parallel Execution in Hierarchical Models [chapter]

Balazs Nemeth, Tom Haber, Jori Liesenborgs, Wim Lamotte
2020 Lecture Notes in Computer Science  
This paper outlines how to identify parallel parts automatically by leveraging the conditional independence property in the graphical model extracted from the dataflow graph of model specifications.  ...  While it is occasionally possible to specify some of these models using parallel building blocks, this limits expressivity. Therefore, a more general generative specification is preferred.  ...  From Conditional Independence to Parallel Execution in Hierarchical Models  ... 
doi:10.1007/978-3-030-50371-0_12 fatcat:ptdr5dwpyvfb3gjww4klowm3bi

Compiler Optimization for Reducing Leakage Power in Multithread BSP Programs

Wen-Li Shih, Yi-Ping You, Chung-Wen Huang, Jenq Kuen Lee
2014 ACM Transactions on Design Automation of Electronic Systems  
Our multithread programming model is based on hierarchical bulk-synchronous parallel (BSP) models.  ...  Based on a multithread component analysis with dataflow equations, our MTPGA framework estimates the energy usage of multithread programs and inserts PPG operations as power controls for energy management  ...  The algorithm complexity of parallel programs can then be analyzed in the BSP model by considering both locality and parallelism issues.  ... 
doi:10.1145/2668119 fatcat:use7itcg5jallgk3fwju377mla

ASAP: Asynchronous Approximate Data-Parallel Computation [article]

Asim Kadav, Erik Kruus
2016 arXiv   pre-print
In this paper, we present ASAP, a model that provides asynchronous and approximate processing semantics for data-parallel computation.  ...  These algorithms are often distributed over multiple machines using bulk-synchronous processing (BSP) or other synchronous processing paradigms such as map-reduce.  ...  Acknowledgments We would like to thank Cun Mu for his help with the analysis of stochastic reduce convergence, and Igor Durdanovic for helping us port RAPID to MALT-2.  ... 
arXiv:1612.08608v1 fatcat:sy7t3mr6lrddjafm7anwp2j7vu

Toward a Parallel Turing Machine Model [chapter]

Peng Qu, Jin Yan, Guang R. Gao
2016 Lecture Notes in Computer Science  
Lacking a solid yet intuitive parallel Turing machine model will continue to be a serious challenge.  ...  Our paper presents an attempt to address this challenge -by presenting a proposal of a parallel Turing machine model -the PTM model.  ...  Dennis at MIT whose pioneer work in computer systems and dataflow have greatly inspired this work.  ... 
doi:10.1007/978-3-319-47099-3_16 fatcat:grphbunrfze7toikjpimoctbse

Giraph unchained

Minyang Han, Khuzaima Daudjee
2015 Proceedings of the VLDB Endowment  
The bulk synchronous parallel (BSP) model used by synchronous graph processing systems allows algorithms to be easily implemented and reasoned about.  ...  We propose barrierless asynchronous parallel (BAP), a new computation model that reduces both message staleness and global synchronization.  ...  The BSP Model Bulk synchronous parallel (BSP) [34] is a parallel computation model in which computations are divided into a series of (BSP) supersteps separated by global barriers (Figure 2 ).  ... 
doi:10.14778/2777598.2777604 fatcat:xtomc2gqhjcs3oeezefa5k5ocq

GoFFish: A Sub-graph Centric Framework for Large-Scale Graph Analytics [chapter]

Yogesh Simmhan, Alok Kumbhare, Charith Wickramaarachchi, Soonil Nagarkar, Santosh Ravi, Cauligi Raghavendra, Viktor Prasanna
2014 Lecture Notes in Computer Science  
We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility.  ...  Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading  ...  These performance gains are due to both the partitioned graph storage and subgraph based retrieval from GoFS, and a significant reduction in the number of supersteps that helps us complete faster.  ... 
doi:10.1007/978-3-319-09873-9_38 fatcat:5yhseslvtjavtonztczswyvdte

Parallel data processing with MapReduce

Kyong-Ha Lee, Yoon-Joon Lee, Hyunsik Choi, Yon Dohn Chung, Bongki Moon
2012 SIGMOD record  
We also discuss the open issues and challenges raised on parallel data analysis with MapReduce.  ...  While MapReduce is used in many areas where massive data analysis is required, there are still debates on its performance, efficiency per node, and simple abstraction.  ...  Pregel implements a programming model motivated by the Bulk Synchronous Parallel(BSP) model.  ... 
doi:10.1145/2094114.2094118 fatcat:kuvfuwss3fcmbf2d7oqqfibmoq

The Case for Polymorphic Registers in Dataflow Computing

Cătălin Bogdan Ciobanu, Georgi Gaydadjiev, Christian Pilato, Donatella Sciuto
2017 International journal of parallel programming  
This article shows how PRFs can be integrated into dataflow computational platforms.  ...  Data parallel solutions such as Polymorphic Register Files (PRFs) can potentially accelerate applications by facilitating high-speed, parallel access to performance-critical data.  ...  Hwu and Nasser Salim Anssari from the University of Illinois at Urbana-Champaign for assisted us with obtaining the NVIDIA Tesla C2050 2D separable convolution results.  ... 
doi:10.1007/s10766-017-0494-1 fatcat:bcttuesbpbhp7jrtcv5b5kl5hi

Pregelix: Big(ger) Graph Analytics on A Dataflow Engine [article]

Yingyi Bu, Vinayak Borkar, Jianfeng Jia, Michael J. Carey, Tyson Condie
2014 arXiv   pre-print
Pregelix is a new open source distributed graph processing system that is based on an iterative dataflow design that is better tuned to handle both in-memory and out-of-core workloads.  ...  ., we have seen up to 15x speedup compared to Apache Giraph and up to 35x speedup compared to distributed GraphLab), and makes more effective use of available machine resources to support Big(ger) Graph  ...  We also thank the following people who tried Pregelix at the early stage, reported bugs, hardened the system, and gave us feedback: Jacob Biesinger, Da Yan, Anbang Xu, Nan Zhang, Vishal Patel, Joe Simons  ... 
arXiv:1407.0455v1 fatcat:gq6jqcmptbejjfslnee5wdaouu

Graspan

Kai Wang, Aftab Hussain, Zhiqiang Zuo, Guoqing Xu, Ardalan Amiri Sani
2017 Proceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS '17  
We develop Graspan, a disk-based parallel graph system that uses an edge-pair centric computation model to compute dynamic transitive closures on very large program graphs.  ...  We implement fully context-sensitive pointer/alias and dataflow analyses on Graspan.  ...  Parallel Edge Addition Algorithm 1 shows a BSP-like algorithm for the parallel EP-centric computation.  ... 
doi:10.1145/3037697.3037744 dblp:conf/asplos/WangHZXS17 fatcat:jp3mbapaizhknjiblr5ln3h6iu

Graspan

Kai Wang, Aftab Hussain, Zhiqiang Zuo, Guoqing Xu, Ardalan Amiri Sani
2017 ACM SIGOPS Operating Systems Review  
We develop Graspan, a disk-based parallel graph system that uses an edge-pair centric computation model to compute dynamic transitive closures on very large program graphs.  ...  We implement fully context-sensitive pointer/alias and dataflow analyses on Graspan.  ...  Parallel Edge Addition Algorithm 1 shows a BSP-like algorithm for the parallel EP-centric computation.  ... 
doi:10.1145/3093315.3037744 fatcat:suhvrgg7gzbfrd6qhzusxt2y7i

Graspan

Kai Wang, Aftab Hussain, Zhiqiang Zuo, Guoqing Xu, Ardalan Amiri Sani
2017 SIGPLAN notices  
We develop Graspan, a disk-based parallel graph system that uses an edge-pair centric computation model to compute dynamic transitive closures on very large program graphs.  ...  We implement fully context-sensitive pointer/alias and dataflow analyses on Graspan.  ...  Parallel Edge Addition Algorithm 1 shows a BSP-like algorithm for the parallel EP-centric computation.  ... 
doi:10.1145/3093336.3037744 fatcat:fyo6brxc2nhdjhdibuv3cqbgum
« Previous Showing results 1 — 15 out of 73 results