2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献_第6页

Optimal Capacity Allocation for Executing MapReduce Jobs in Cloud Systems 云系统中MapReduce任务的最优容量分配

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.58

M. Malekimajd, A. M. Rizzi, D. Ardagna, M. Ciavotta, M. Passacantando, A. Movaghar

{"title":"Optimal Capacity Allocation for Executing MapReduce Jobs in Cloud Systems","authors":"M. Malekimajd, A. M. Rizzi, D. Ardagna, M. Ciavotta, M. Passacantando, A. Movaghar","doi":"10.1109/SYNASC.2014.58","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.58","url":null,"abstract":"Nowadays, analyzing large amount of data is of paramount importance for many companies. Big data and business intelligence applications are facilitated by the MapReduce programming model while, at infrastructural layer, cloud computing provides flexible and cost effective solutions for allocating on demand large clusters. Capacity allocation in such systems is a key challenge to providing performance for MapReduce jobs and minimize cloud resource cost. The contribution of this paper is twofold: (i) we formulate a linear programming model able to minimize cloud resources cost and job rejection penalties for the execution of jobs of multiple classes with (soft) deadline guarantees, (ii) we provide new upper and lower bounds for MapReduce job execution time in shared Hadoop clusters. Moreover, our solutions are validated by a large set of experiments. We demonstrate that our method is able to determine the global optimal solution for systems including up to 1000 user classes in less than 0.5 seconds. Moreover, the execution time of MapReduce jobs are within 19% of our upper bounds on average.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126088969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

Using Cylindrical Algebraic Decomposition and Local Fourier Analysis to Study Numerical Methods: Two Examples 用圆柱代数分解和局部傅立叶分析研究数值方法:两个例子

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.14

Stefan Takacs

{"title":"Using Cylindrical Algebraic Decomposition and Local Fourier Analysis to Study Numerical Methods: Two Examples","authors":"Stefan Takacs","doi":"10.1109/SYNASC.2014.14","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.14","url":null,"abstract":"Local Fourier analysis is a strong and well-established tool for analyzing the convergence of numerical methods for partial differential equations. The key idea of local Fourier analysis is to represent the occurring functions in terms of a Fourier series and to use this representation to study certain properties of the particular numerical method, like the convergence rate or an error estimate. In the process of applying a local Fourier analysis, it is typically necessary to determine the supremum of a more or less complicated term with respect to all frequencies and, potentially, other variables. The problem of computing such a supremum can be rewritten as a quantifier elimination problem, which can be solved with cylindrical algebraic decomposition, a well-known tool from symbolic computation. The combination of local Fourier analysis and cylindrical algebraic decomposition is a machinery that can be applied to a wide class of problems. In the present paper, we will discuss two examples. The first example is to compute the convergence rate of a multigrid method. As second example we will see that the machinery can also be used to do something rather different: We will compare approximation error estimates for different kinds of discretizations.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127402286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Central Dogma of Molecular Biology - New Paradigm in Evolutionary Computation 分子生物学的中心法则——进化计算的新范式

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.46

C. Rotar

引用次数: 11

Correct Metric Semantics for a Biologically-Inspired Formalism 生物学启发的形式主义的正确度量语义

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.50

Gabriel Ciobanu, E. Todoran

引用次数: 1

Investigation of Alternative Evolutionary Prototype Generation in Medical Classification 医学分类中替代进化原型生成的研究

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.77

C. Stoean, R. Stoean, Adrian Sandita

引用次数: 2

Model-Driven Design of Cloud Applications with Quality-of-Service Guarantees: The MODAClouds Approach, MICAS Tutorial 具有服务质量保证的云应用的模型驱动设计:modclouds方法，MICAS教程

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.8

M. A. D. Silva, D. Ardagna, Nicolas Ferry, Juan F. Pérez

引用次数: 3

Proof Generation from Delta-Decisions 从delta决策生成证明

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.29

Sicun Gao, Soonho Kong, E. Clarke

引用次数: 9

High-Probability Mutation in Basic Genetic Algorithms 基本遗传算法中的高概率突变

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.48

Nicolae-Eugen Croitoru

引用次数: 6

Pedestrian Recognition by Using a Kernel-Based Multi-modality Approach 基于核的多模态行人识别方法

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.42

A. Sirbu, A. Rogozan, L. Dioşan, A. Bensrhair

引用次数: 3

A Heuristic-Based Approach for Reducing the Power Consumption of Real-Time Embedded Systems 一种基于启发式的实时嵌入式系统功耗降低方法

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2014-09-01 DOI: 10.1109/SYNASC.2014.31

V. Radulescu, S. Andrei, A. Cheng

{"title":"A Heuristic-Based Approach for Reducing the Power Consumption of Real-Time Embedded Systems","authors":"V. Radulescu, S. Andrei, A. Cheng","doi":"10.1109/SYNASC.2014.31","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.31","url":null,"abstract":"The current trend in designing power-efficient devices is concerning not only Personal Computer-like (PC) systems, but also real-time embedded systems. While a lot of research has been done on minimizing the total energy of a system, adapting the scheduling techniques for lower energy consumption has been less popular. Nevertheless, this can prove highly efficient, as the Central Processing Units (CPUs) are usually responsible for the largest part of the whole system's energy consumption. This paper presents an approach on improving the energy consumption of a real-time system. Starting with a given feasible schedule for a non-preemptive, single-instance, n-task set, power saving is achieved by reducing the CPU frequency whenever possible, without breaking the task deadlines. The goal can be described in analytical terms as a multivariate optimization problem. Due to the complexity of the resulting problem, the use of heuristic techniques provides good chances for finding the desired optimum. To the best of our knowledge, the use of these methods for the power-aware scheduling problem has not been attempted.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124488479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3