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

Evaluating Weighted Round Robin Load Balancing for Cloud Web Services 评估云Web服务的加权轮询负载均衡

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

Weikun Wang, G. Casale

{"title":"Evaluating Weighted Round Robin Load Balancing for Cloud Web Services","authors":"Weikun Wang, G. Casale","doi":"10.1109/SYNASC.2014.59","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.59","url":null,"abstract":"Weighted round robin load balancing is a common routing policy offered in cloud load balancers. However, there is a lack of effective mechanisms to decide the weights assigned to each server to achieve an overall optimal revenue of the system. In this paper, we first experimentally explore the relation between probabilistic routing and weighted round robin load balancing policies. From the experiment a similar behavior is found between these two policies, which makes it possible to assign the weights according to the routing probability estimated from queueing theoretic heuristic and optimization algorithms studied in the literature. We focus in particular on algorithms based on closed queueing networks for multi-class workloads, which can be used to describe application with service level agreements differentiated across users. We also compare the efficiency of queueing theoretic methods with simple heuristics that do not require to specify a stochastic model of the application. Results indicate that queueing theoretical algorithms yield significantly better results than routings proportional to the VM capacity with respect to throughput maximization.","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-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115134690","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}

引用次数: 48

Computing Homological Information Based on Directed Graphs within Discrete Objects 基于离散对象内有向图的同调信息计算

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

A. Gonzalez-Lorenzo, A. Bac, J. Mari, P. Real

引用次数: 3

Lipschitz Bounds for Noise Robustness in Compressive Sensing: Two Algorithms 压缩感知噪声鲁棒性的Lipschitz界:两种算法

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

Marc Nicodeme, C. Dossal, F. Turcu, Y. Berthoumieu

引用次数: 2

Open and Interoperable Socio-technical Networks 开放和可互操作的社会技术网络

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

A. Ciortea, O. Boissier, Antoine Zimmermann, A. Florea

引用次数: 2

Automated Synthesis of Target-Dependent Programs for Polynomial Evaluation in Fixed-Point Arithmetic 不动点算法中多项式求值目标相关程序的自动综合

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

C. Mouilleron, Amine Najahi, G. Revy

{"title":"Automated Synthesis of Target-Dependent Programs for Polynomial Evaluation in Fixed-Point Arithmetic","authors":"C. Mouilleron, Amine Najahi, G. Revy","doi":"10.1109/SYNASC.2014.27","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.27","url":null,"abstract":"The design of both fast and numerically accurate programs is a real challenge. Thus, the CGPE tool was introduced to assist programmers in synthesizing fast and numerically certified codes in fixed-point arithmetic for the particular case of polynomial evaluation. For performance purposes, this tool produces programs using exclusively unsigned arithmetic and addition/subtraction or multiplication operations, thus requiring some constraints on the fixed-point operands. These choices are well-suited when dealing with the implementation of certain mathematical functions, however they prevent from tackling a broader class of polynomial evaluation problems. In this paper, we first expose a rigorous arithmetic model for CGPE that takes into account signed arithmetic. Then, in order to make the most out of advanced instructions, we enhance this tool with a multi-criteria instruction selection module. This allows us to optimize the generated codes according to different criteria, like operation count, evaluation latency, or accuracy. Finally, we illustrate this technique on operation count, and we show that it yields an average reduction of up to 22.3% of the number of operations in the synthesized codes of some functions. We also explicit practical examples to show the impact of using accuracy based rather than latency based instruction selection.","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-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126254257","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}

引用次数: 6

Reliable Management of Virtualized Resources Using Fault Trees 通过故障树实现虚拟化资源的可靠管理

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

A. Butoi, Alexandru-Ioan Stan, G. Silaghi

引用次数: 2

Mining GPS Data to Learn Driver's Route Patterns 挖掘GPS数据学习驾驶员路线模式

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

E. Necula

{"title":"Mining GPS Data to Learn Driver's Route Patterns","authors":"E. Necula","doi":"10.1109/SYNASC.2014.43","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.43","url":null,"abstract":"Over the last few years, GPS guidance systems have become increasingly more popular. GPS-equipped devices like smart phones become more common and larger amounts of GPS data become available to geographic applications. Having precise information about the routes of a driver during a period of time can be useful to learn and estimate both the traffic and the driver's intent at specific moment of time. With our solution we want to go a step further to the existing GPS navigation systems by designing a mechanism that is capable to learn driver's routes. We could offer in the future a point-to-point concept for an environmentally friendly routing mechanism anywhere within a selected road network based on our HMM-method and a training process. Our study is based on real data collected from various local drivers and can be easily applied in modern intelligent traffic systems. The system comes with a user interface that displays the GPS routes on the map for a specific driver. These routes can be analyzed using parameters like time, distance, height and speed. Also we developed a tool that manages to compute the maximum-likelihood using the Viterbi algorithm in order to validate the next route segment election for a sampled road network.","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":"126731719","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}

引用次数: 4

Semantic Modeling of Information for Freight Transportation Broker 货运代理信息的语义建模

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

Lucian Luncean, C. Bǎdicǎ

引用次数: 8

A Receding Horizon Approach for the Runtime Management of IaaS Cloud Systems IaaS云系统运行时管理的渐退地平线方法

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

D. Ardagna, M. Ciavotta, R. Lancellotti

{"title":"A Receding Horizon Approach for the Runtime Management of IaaS Cloud Systems","authors":"D. Ardagna, M. Ciavotta, R. Lancellotti","doi":"10.1109/SYNASC.2014.66","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.66","url":null,"abstract":"Cloud Computing is emerging as a major trend in ICT industry. However, as with any new technology it raises new major challenges and one of them concerns the resource provisioning. Indeed, modern Cloud applications deal with a dynamic context and have to constantly adapt themselves in order to meet Quality of Service (QoS) requirements. This situation calls for advanced solutions designed to dynamically provide cloud resource with the aim of guaranteeing the QoS levels. This work presents a capacity allocation algorithm whose goal is to minimize the total execution cost, while satisfying some constraints on the average response time of Cloud based applications. We propose a receding horizon control technique, which can be employed to handle multiple classes of requests. We compare our solution with an oracle with perfect knowledge of the future and with a well-known heuristic described in the literature. The experimental results demonstrate that our solution outperforms the existing heuristic producing results very close to the optimal ones. Furthermore, a sensitivity analysis over two different time scales indicates that finer grained time scales are more appropriate for spiky workloads, whereas smooth traffic conditions are better handled by coarser grained time scales. Our analytical results are also validated through simulation, which shows also the impact on our solution of Cloud environment random perturbations.","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":"122823303","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}

引用次数: 16

A Parallel, Distributed, High-Performance Architecture for Simulating Particle-Based Models 一种用于模拟粒子模型的并行、分布式、高性能体系结构

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

A. Sabou, D. Gorgan

{"title":"A Parallel, Distributed, High-Performance Architecture for Simulating Particle-Based Models","authors":"A. Sabou, D. Gorgan","doi":"10.1109/SYNASC.2014.73","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.73","url":null,"abstract":"Particle-based models are widespread in the field of computer graphics and are mostly used in soft-body dynamics, for simulating surfaces such as cloth, fluids and biologic tissue. As model resolution and scenario complexity increases, the computation required for these particular applications becomes overwhelming for a single processing unit, especially when interactivity is required, thus parallelization must be employed in order to provide a fast, flexible and scalable simulation environment. High-performance computing architectures such as graphics clusters may provide the parallel computing and rendering power required, but the distributed and remote nature of the computation and rendering process introduce specific challenges that must be tackled. We propose a parallel, distributed, modular system architecture for a particle-based simulator on GPU clusters, encapsulating powerful parallel and distributed processing, distributed rendering and remote interaction techniques, for flexible, fast simulation of large models and complex scenarios. For validating and evaluating the proposed architecture, we perform a visual comparison of two largely used numeric integration methods, namely the explicit Velocity Verlet and implicit Euler integration techniques.","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":"123191405","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