发布求助
文献互助 智能选刊 最新文献

2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献

筛选
英文 中文
Speculative Genetic Scheduling Method for Hadoop Environments 基于Hadoop环境的推测遗传调度方法
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2012-09-26 DOI: 10.1109/SYNASC.2012.62
D. Pletea, Florin Pop, V. Cristea
{"title":"Speculative Genetic Scheduling Method for Hadoop Environments","authors":"D. Pletea, Florin Pop, V. Cristea","doi":"10.1109/SYNASC.2012.62","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.62","url":null,"abstract":"The existence of computational intensive applications with a high degree of granularity which have to be executed as quickly as possible or sometimes with budget limitations makes the scheduling problem to be very important in today's distributed systems. In the context of the distributed systems being used by a various community of users, the quality and precision of the scheduling must be as close to optimality as possible. We present in this paper a scheduling method based on a genetic algorithm which respects the deadline constraints. Based on this model we developed a scheduler for MapReduce applications which also takes into account the heterogeneity of distributed systems. The developed scheduler was created for Hadoop platform, an already successful framework, and it can be built in conjunction with other existing Hadoop's schedulers like: fair-scheduler or capacity-scheduler. We tested and validated this model by testing its scalability and by comparing it with existing solutions in Hadoop. The novelty of this solution is that compared to other planners in Hadoop it meets the deadline and budget constraints and thus provides trust for the Hadoop platform.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"455 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130630852","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
Synthesis from Examples: Interaction Models and Algorithms 实例综合:交互模型和算法
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2012-09-26 DOI: 10.1109/SYNASC.2012.69
Sumit Gulwani
{"title":"Synthesis from Examples: Interaction Models and Algorithms","authors":"Sumit Gulwani","doi":"10.1109/SYNASC.2012.69","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.69","url":null,"abstract":"Examples are often a natural way to specify various computational artifacts such as programs, queries, and sequences. Synthesizing such artifacts from example based specifications has various applications in the domains of end-user programming and intelligent tutoring systems. Synthesis from examples involves addressing two key technical challenges: (i) design of a user interaction model to deal with the inherent ambiguity in the example based specification. (ii) design of an efficient search algorithm - these algorithms have been based on paradigms from various communities including use of SAT/SMT solvers (formal methods community), version space algebras (machine learning community), and A*-style goal-directed heuristics (AI community). This paper describes some effective user interaction models and algorithmic methodologies for synthesis from examples while discussing synthesizers for a variety of artifacts ranging from tricky bit vector algorithms, spreadsheet macros for automating repetitive data manipulation tasks, ruler/compass based geometry constructions, algebraic identities, and predictive intellisense for repetitive drawings and mathematical terms.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126665632","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}
引用次数: 78
Service Lifecycle in the Cloud Environment 云环境中的服务生命周期
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2012-09-26 DOI: 10.1109/SYNASC.2012.67
V. Munteanu, Teodor-Florin Fortiş, V. Negru
{"title":"Service Lifecycle in the Cloud Environment","authors":"V. Munteanu, Teodor-Florin Fortiş, V. Negru","doi":"10.1109/SYNASC.2012.67","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.67","url":null,"abstract":"Cloud governance's approach to development in the cloud environment allows for a way in which services are well defined and unambiguous, where they can be easily designed, implemented, deployed and executed, for a way in which they can be consumed. This approach is beneficial to SMEs which can now empower themselves by adopting cloud-based technologies and platforms. They now have the opportunity to develop niche solutions, or to group themselves in specialized clusters, in order to build complex, targeted solutions, tailored on customers' needs. The focus of this paper is detailing the service lifecycle from the point of view of our proposed cloud governance architecture that is based on a cloud management solution, the Cloud Agency, a multi-agent system that is part of the mOSAIC project.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115216035","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}
引用次数: 7
Computing with Free Algebras 自由代数的计算
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2012-09-26 DOI: 10.1109/SYNASC.2012.19
Paul Tarau
{"title":"Computing with Free Algebras","authors":"Paul Tarau","doi":"10.1109/SYNASC.2012.19","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.19","url":null,"abstract":"We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all of them when seen as isomorphic with the set of natural numbers. Constructors and deconstructors seen through an initial algebra semantics are generalized to recursively defined functions obeying similar laws. Implementations using GHC's \"view\" construct are discussed, based on the free algebra of rooted ordered binary trees.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134629773","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
Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc 复数、带分支割函数等的程序验证
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2012-09-26 DOI: 10.1109/SYNASC.2012.68
J. Davenport, R. Bradford, M. England, D. Wilson
{"title":"Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc","authors":"J. Davenport, R. Bradford, M. England, D. Wilson","doi":"10.1109/SYNASC.2012.68","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.68","url":null,"abstract":"In considering the reliability of numerical programs, it is normal to ``limit our study to the semantics dealing with numerical precision'' (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that essentially ignores the numerics. The thesis of this paper is that there is a class of problems that fall between these two, which could be described as ``does the low-level arithmetic implement the high-level mathematics''. Many of these problems arise because mathematics, particularly the mathematics of the complex numbers, is more difficult than expected: for example the complex function log is not continuous, writing down a program to compute an inverse function is more complicated than just solving an equation, and many algebraic simplification rules are not universally valid. The good news is that these problems are theoretically capable of being solved, and are practically close to being solved, but not yet solved, in several real-world examples. However, there is still a long way to go before implementations match the theoretical possibilities.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114082700","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}
引用次数: 34
Toward an Optimal Power-Aware Scheduling Technique 一种最优的功率感知调度技术
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2012-09-26 DOI: 10.1109/SYNASC.2012.26
S. Andrei, A. Cheng, V. Radulescu, T. McNicholl
{"title":"Toward an Optimal Power-Aware Scheduling Technique","authors":"S. Andrei, A. Cheng, V. Radulescu, T. McNicholl","doi":"10.1109/SYNASC.2012.26","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.26","url":null,"abstract":"With the rapid demand of portable and mobile embedded systems, reducing energy consumption has become a vital research area in the real-time embedded systems community. There exist many research works which describe scheduling algorithms minimizing the total energy of a system. However, very few works describe scheduling techniques for which the energy consumption is optimal. This paper describes a scheduling technique which provides an optimal schedule in terms of power consumption on a uniprocessor platform running non-preeemptive jobs. To the best of our knowledge, there is no analytical formula of the minimum energy for an arbitrary job set with n jobs, where n ≥ 2 is the number of jobs. A multi-case analytical formula for the minimum energy of job sets with two jobs is provided here as an original contribution.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123383285","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}
引用次数: 2
Experiences in Symbolic Computations for Matrix Problems 矩阵问题符号计算经验
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2012-09-26 DOI: 10.1109/SYNASC.2012.9
S. Kasjan, Andrzej Mróz
{"title":"Experiences in Symbolic Computations for Matrix Problems","authors":"S. Kasjan, Andrzej Mróz","doi":"10.1109/SYNASC.2012.9","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.9","url":null,"abstract":"We review our recent results concerning several computer algebra aspects of determining canonical forms, performing a decomposition and deciding the isomorphism question for matrix problems. We consider them in the language of finite dimensional modules over algebra and the language of square block matrices with an action of elements from some sub algebra of the full matrix algebra. We present an efficient (polynomial-time) improvement of classical Bongartz's algorithm for determining a maximal common direct summand of modules, and its application to solving the isomorphism problem. The improved algorithm recently became a part of QPA package ver. 1.07 for GAP. We also study the behaviour of Belitskii's algorithm for determining certain canonical form on a class of square block matrices, especially for matrix problems associated with a poset. Both problems can be considered as a highly generalized classical Jordan problem for square matrices.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124551776","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}
引用次数: 8
Automated Synthesis of Some Algorithms on Finite Sets 有限集上一些算法的自动综合
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2012-09-26 DOI: 10.1109/SYNASC.2012.43
I. Dramnesc, T. Jebelean
{"title":"Automated Synthesis of Some Algorithms on Finite Sets","authors":"I. Dramnesc, T. Jebelean","doi":"10.1109/SYNASC.2012.43","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.43","url":null,"abstract":"We start from the set theory axioms and we represent sets by monotone lists (sorted lists without duplications). For this, we define a representation function R and its reverse S and we want to synthesize the implementation of the essential corresponding predicates and functions over sets. Each synthesis starts as an inductive constructive proof which applies specific strategies and inference rules. We synthesize (by extracting from proofs) five algorithms among which two predicates: membership and inclusion, and three functions: union, intersection, and difference. In the process of proving we use properties from the theory of sets and we also add other necessary properties in the knowledge base. In this way we explore the theory of sets (represented as monotone lists). The program synthesis and the corresponding theory exploration are carried out in the frame of the Theorem a system. One of the major advantages of our approach is that the algorithms for operating on sets represented as monotone lists are more efficient than the ones for operating on sets represented as non-sorted lists.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131459181","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}
引用次数: 10
Towards multi-tenant and interoperable monitoring of virtual machines in cloud 迈向云中虚拟机的多租户和可互操作监控
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2012-09-26 DOI: 10.1109/SYNASC.2012.55
Daniel Tovarnák, T. Pitner
{"title":"Towards multi-tenant and interoperable monitoring of virtual machines in cloud","authors":"Daniel Tovarnák, T. Pitner","doi":"10.1109/SYNASC.2012.55","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.55","url":null,"abstract":"The advent of Cloud Computing introduced new challenges in various computer science fields and disciplines, monitoring being one of them. Due to the multi-tenant nature of Cloud environment, its size and use of massive virtualization, the current monitoring solutions are approaching their limits. Unlike some other approaches, focusing on data integration, aggregation, and abstraction, our work focuses on a virtual machine representing the primary source of monitoring information. In this paper, we propose requirements for the producer of monitoring information addressing existing issues related to monitoring data representation, storage, processing and distribution. As a proof-of-concept, conforming to these requirements, prototype of event-based monitoring daemon is presented in detail. The resulting solution allows multiple users to consume monitoring information in an extensible data format without impairing interoperability.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132151400","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}
引用次数: 18
SENSAPP as a Reference Platform to Support Cloud Experiments: From the Internet of Things to the Internet of Services SENSAPP作为支持云实验的参考平台:从物联网到服务互联网
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2012-09-26 DOI: 10.1109/SYNASC.2012.71
Sébastien Mosser, Franck Fleurey, Brice Morin, Franck Chauvel, Arnor Solberg, Iokanaan Goutier
{"title":"SENSAPP as a Reference Platform to Support Cloud Experiments: From the Internet of Things to the Internet of Services","authors":"Sébastien Mosser, Franck Fleurey, Brice Morin, Franck Chauvel, Arnor Solberg, Iokanaan Goutier","doi":"10.1109/SYNASC.2012.71","DOIUrl":"https://doi.org/10.1109/SYNASC.2012.71","url":null,"abstract":"The Cloud-computing paradigm was considered as a revolution. Thanks to the abstraction of computing resources \"in the clouds\" this paradigm provides \"anything\" as a service, on a pay-as-you-go basis. Unfortunately, there is no reference software that one can use to properly compare a cloud approach against others. We propose the SENSAPP platform to tackle this challenge. SENSAPP is designed as a prototypical cloud application and is provided as an open-source service-based application used to store and exploit data collected by the Internet of Things. We propose SENSAPP as a reference implementation to compare different cloud approaches. In this paper we present initial experiments about scalability based on this platform.","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"2 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132329943","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}
引用次数: 31
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信