3,080 Hits in 5.5 sec

An Optimized Model for MapReduce Based on Hadoop

Zhang Hong, Wang Xiao-ming, Cao Jie, Ma Yan-hong, Guo Yi-rong, Wang Min
2016 TELKOMNIKA (Telecommunication Computing Electronics and Control)  
Aiming at the waste of computing resources resulting from sequential control of running mechanism of MapReduce model on Hadoop platform,Fork/Join framework has been introduced into this model to make full  ...  From the perspective of fine-grained parallel data processing, combined with Fork/Join framework,a parallel and multi-thread model,this paper optimizes MapReduce model and puts forward a MapReduce+Fork  ...  MapReduce+Fork/Join Hybrid Model MapReduce+Fork/Join computing model based on Hadoop platform is described in Figure 2 . The whole system is Master-slave structure.  ... 
doi:10.12928/telkomnika.v14i4.3606 fatcat:kcettjgtq5d3dkvad3d647dj3q

Communication Aware task Placement for Workflow Scheduling on DaaS-Based Cloud

Hadrien Croubois, Eddy Caron
2017 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)  
Simulations of Fork-Join workflows deployment using SimGrid show that our algorithm reduces computation time as well as deployment costs.  ...  Thus, we manage to statically pack tasks so that a batch scheduler could deploy many real-time submitted workflows on a dynamic Cloud platform.  ...  Acknowledgments Experiments presented in this paper were carried out using the Grid'5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities  ... 
doi:10.1109/ipdpsw.2017.96 dblp:conf/ipps/CrouboisC17 fatcat:pb5myhdnnjfzzgqeoiidjdcafm

Towards transparent parallel/distributed support for real-time embedded applications

Ricardo Garibay-Martinez, Luis Lino Ferreira, Claudio Maia, Luis Miguel Pinho
2013 2013 8th IEEE International Symposium on Industrial Embedded Systems (SIES)  
This evaluation gives important hints, towards the development of the parallel/distributed fork-join model for real-time embedded applications.  ...  An increasing number of real-time embedded applications present high computation requirements which need to be realized within strict time constraints.  ...  Figure 2 . 2 Timeline of a real-time task using the parallel/distributed fork-join model.  ... 
doi:10.1109/sies.2013.6601483 dblp:conf/sies/Garibay-MartinezFMP13 fatcat:utyleaclqvb4rhf326nsmqvkuu

Real-World Clustering for Task Graphs on Shared Memory Systems [chapter]

Alexander Herz, Chris Pinkau
2015 Lecture Notes in Computer Science  
Finally, we present the first clustering algorithm which guarantees a real-world speedup by clustering all parallel tasks in the task graph that cannot be efficiently executed in parallel.  ...  Previous static scheduling algorithms assume negligible run-time overhead of spawning and joining tasks.  ...  Many Node Fork/Join Graphs Fork/Join graphs with more than two spawned nodes as shown in Fig. 3 are handled as follows.  ... 
doi:10.1007/978-3-319-15789-4_2 fatcat:py3p7purt5dldf3qpo27aitteq

Resource Symmetric Dispatch Model for Internet of Things on Advanced Logistics

Guofeng Qin, Lisheng Wang, Qiyan Li
2016 Symmetry  
For real-time customer service, dynamic symmetric resource dispatch and load balancing on multi-cores play a very important role for high performance cluster computing ability in low power [13] .  ...  The data and information are classified and processed by the clustering servers in the cloud service platform.  ...  The task scheduling algorithm is based on Java Fork/Join framework and classic task scheduling algorithm.  ... 
doi:10.3390/sym8040020 fatcat:inqhgloj4jf5bm2y4ifx4pgpjq

Real-Time Support in the Proposal for Fine-Grained Parallelism in Ada

Luis Miguel Pinho, Brad Moore, Stephen Michell, S. Tucker Taft
2015 2015 IEEE Real-Time Systems Symposium  
The Ada language has for long provided supportfor the development of reliable real-time systems, with a modelof computation amenable for real-time analysis.  ...  Abstract- The Ada language has for long provided support for the development of reliable real-time systems, with a model of computation amenable for real-time analysis.  ...  This paper provides an overview of this model, presenting some of the current main open issues for real-time computing. The paper is structured as follows.  ... 
doi:10.1109/rtss.2015.43 dblp:conf/rtss/PinhoMMT15 fatcat:mznwcuh26jbenlrjftkj6bup7i

Distributed Collaborative Task Scheduling Algorithm Based on HPC-RTI

2017 Revista Técnica de la Facultad de Ingeniería Universidad del Zulia  
In order to improve the simulation ability, efficient communication ability and real-time capability of large scale complex product prototype, a task scheduling strategy based on multi core cluster hierarchy  ...  characteristics and node conflict cost is designed based on the support and framework constraints of High Performance Computing-Run-Time Infrastructure(HPC-RTI), and the scheduling performance, algorithm  ...  is a basic model structure for parallel processing, and most of the task graphs can be simplified to a combination of Join and Fork structures.  ... 
doi:10.21311/ fatcat:4nxgp7nzabcnhmtyvx3uubj4me

Performance Prediction of Cloud-Based Big Data Applications

Danilo Ardagna, Enrico Barbierato, Athanasia Evangelinou, Eugenio Gianniti, Marco Gribaudo, Túlio B. M. Pinto, Anna Guimarães, Ana Paula Couto da Silva, Jussara M. Almeida
2018 Proceedings of the 2018 ACM/SPEC International Conference on Performance Engineering - ICPE '18  
The three approaches are compared in terms of prediction accuracy, finding that our best approaches can predict average application execution times with 26% relative error in the very worst case and about  ...  In such context, the flexibility and elasticity provided by the cloud computing paradigm offer a natural approach to cost-effectively adapting the allocated resources to the application's current needs  ...  For scenario 2, the Fork-Join model obtained 225.33%, the Task Precedence model obtained 16.92%, and dagSim obtained 0.74%. Cores Real Fork-Join (error %) Task Prec.  ... 
doi:10.1145/3184407.3184420 dblp:conf/wosp/ArdagnaBEGGPGSA18 fatcat:c4xfnwy6bba77ek34m5mqn5sae

An approach for non-intrusively adding malleable fork/join parallelism into ordinary JavaBean compliant applications

Cristian Mateos, Alejandro Zunino, Marcelo Campo
2010 Computer languages, systems & structures  
EasyFJP is based upon the popular fork/join parallel pattern, and combines implicit, application-level parallelism with explicit, non-invasive application tuning.  ...  Motivated by the advent of powerful hardware such as SMP machines and execution environments such as Grids, research in parallel programming has gained much attention within the Distributed Computing community  ...  Acknowledgments We thank Cristian Clasadonte for his good predisposition and valuable help managing the computing infrastructure used for conducting the experiments described in this paper.  ... 
doi:10.1016/ fatcat:235q7ihgpnbdph7ggx4gihgray

WSCOM: Online Task Scheduling with Data Transfers

Jean-Noël Quintin, Frédéric Wagner
2012 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)  
In our paper we consider the on-line problem of tasks scheduling with communication. All information on tasks and communication are not available in advance except the DAG of task topology.  ...  Moreover we show that WSCOM can achieve the same high performances as the classical work-stealing with up to ten times less bandwidth.  ...  In particular most algorithms execute communications as soon as possible in order to cover communication times by computations.  ... 
doi:10.1109/ccgrid.2012.21 dblp:conf/ccgrid/QuintinW12 fatcat:uv4l3hrfcfhpvopj66oicjhapq

Resilient Work Stealing [article]

Pascal Costanza, Charlotte Herzeel, Wolfgang De Meuter, Roel Wuyts
2017 arXiv   pre-print
We propose to model computations in terms of restartable task graphs in order to improve reliability at the software level.  ...  As a proof of concept, we present Cobra, a novel design for a shared-memory work-stealing scheduler that realizes this notion of restartable task graphs, and enables computations to survive hardware failures  ...  being reported for real-world clusters [9, 16, 29] .  ... 
arXiv:1706.03539v1 fatcat:6ra44pvelbbpfaixu2vrg5hyim

EasyFJP: Providing hybrid parallelism as a concern for divide and conquer java applications

Cristian Mateos, Alejandro Zunino, Mat´ıas Hirsch
2013 Computer Science and Information Systems  
In this paper, we present EasyFJP, an approach that implicitly exploits parallelism in Java applications based on the concept of fork-join synchronization pattern, a simple but effective abstraction for  ...  Because of the increasing availability of multi-core machines, clusters, Grids, and combinations of these there is now plenty of computational power, but today's programmers are not fully prepared to exploit  ...  In other words, dynamically dividing the computation in few, computationally heavy tasks that are placed in the same physical cluster makes the rest of the clusters to be underused most of the time.  ... 
doi:10.2298/csis120712021m fatcat:opgqu3ty75etxjjnls72hl6w6y

From Heterogeneous Task Scheduling to Heterogeneous Mixed Parallel Scheduling [chapter]

Frédéric Suter, Frédéric Desprez, Henri Casanova
2004 Lecture Notes in Computer Science  
In this paper we develop a method for extending existing scheduling algorithms for task-parallel applications on heterogeneous platforms to the mixed-parallel case.  ...  Mixed-parallelism, the combination of data-and taskparallelism, is a powerful way of increasing the scalability of entire classes of parallel applications on platforms comprising multiple compute clusters  ...  Fig. 1 . 1 Strassen (left) and Fork-Join (right) DAGs.  ... 
doi:10.1007/978-3-540-27866-5_30 fatcat:hvqeh3wabjcbpa5lapuni22hu4

Static scheduling algorithms for allocating directed task graphs to multiprocessors

Yu-Kwong Kwok, Ishfaq Ahmad
1999 ACM Computing Surveys  
optimal solutions for fork and join graph structures.  ...  optimal schedules for fork and join structures even if given sufficient processors.  ... 
doi:10.1145/344588.344618 fatcat:ipphnrze6febrlqketoc46s65i

An object-oriented platform for distributed high-performance symbolic computation

Wolfgang Blochinger, Wolfgang Küchlin, Christoph Ludwig, Andreas Weber
1999 Mathematics and Computers in Simulation  
We describe the Distributed Object-Oriented Threads System (DOTS), a programming environment designed to support object-oriented fork/join parallel programming in a heterogeneous distributed environment  ...  It has been used for the parallelization of applications in the field of computer algebra and in the field of computer graphics.  ...  By the combination of the join any semantics of dots join with the functionality of dots cancel, DOTS is a powerful tool for the distributed computation of irregularly structured search problems.  ... 
doi:10.1016/s0378-4754(99)00049-x fatcat:xksvvepc7bhftgmuxzd6a5hsge
« Previous Showing results 1 — 15 out of 3,080 results