Compute最新文献_第7页

LibRe: a consistency protocol for modern storage systems LibRe:用于现代存储系统的一致性协议

Compute Pub Date : 2013-08-22 DOI: 10.1145/2522548.2522605

Sathiya Prabhu Kumar, Raja Chiky, Sylvain Lefebvre, E. Gressier-Soudan

{"title":"LibRe: a consistency protocol for modern storage systems","authors":"Sathiya Prabhu Kumar, Raja Chiky, Sylvain Lefebvre, E. Gressier-Soudan","doi":"10.1145/2522548.2522605","DOIUrl":"https://doi.org/10.1145/2522548.2522605","url":null,"abstract":"The dramatic increase of data stored, processed and reused in all sectors leads to the evolution of modern storage systems known as NoSQL databases such as Amazon Dynamo, Cassandra, Big-Table, PNUTS, HBase. In order to boost the availability and performance of the system, these storage systems follow eventual consistency and don't offer tight consistency by default. Paxos is commonly used in this context to ensure tight consistency on demand. But it adds extra costs on messages management, mostly complexity and size. In addition, Paxos shrinks the space for other research areas such as cache memory optimization and load-balancing.\u0000 This paper gives an opportunity to propose and discuss the challenges of a new consistency protocol for modern storage systems entitled 'LibRe'. LibRe follows the Eventual Consistency model. In addition, it logs operations executed on each node in the distributed system. This additional information is used by the load balancer and ensures that requests are not forwarded to a node where the data needed to serve the request are stale. Since Eventual Consistency already offers better Availability and Partition tolerance, the aspiration of associating LibRe with eventual consistency is to work out a better consistency management service providing also availability and partition tolerance. The simulation results for consistency and latency in LibRe are compared among traditional Pessimistic Consistency, Eventual Consistency, and Paxos. The overall results are discussed and new opportunities for research works are provided.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132591104","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}

引用次数: 5

Graph based techniques for user personalization of news streams 基于图形的新闻流用户个性化技术

Compute Pub Date : 2013-08-22 DOI: 10.1145/2522548.2523129

Saurabh Kumar, Mayank Kulkarni

引用次数: 4

Generating topic maps from XML/XSD documents 从XML/XSD文档生成主题图

Compute Pub Date : 2013-08-22 DOI: 10.1145/2522548.2523130

Suman Roy, K. Sawant, O. Charvin

引用次数: 0

Algebraic properties and measures of uncertainty in rough set on two universal sets based on multi-granulation 基于多粒化的两个泛集上粗糙集的代数性质及不确定性测度

Compute Pub Date : 2013-08-22 DOI: 10.1145/2522548.2523168

M. Geetha, D. Acharjya, N. Iyengar

引用次数: 4

An alternate line drawing algorithm on hexagonal grid 六边形网格上的交替划线算法

Compute Pub Date : 2013-08-22 DOI: 10.1145/2522548.2523136

P. Manoharan, B. Ray

引用次数: 0

Durable data storage in distributed non persistent caching environment 分布式非持久化缓存环境下的持久数据存储

Compute Pub Date : 2013-08-22 DOI: 10.1145/2522548.2523128

Deep Parekh, S. Chaudhary

{"title":"Durable data storage in distributed non persistent caching environment","authors":"Deep Parekh, S. Chaudhary","doi":"10.1145/2522548.2523128","DOIUrl":"https://doi.org/10.1145/2522548.2523128","url":null,"abstract":"To achieve scalability is one of the major issues in dynamic web applications. One of the ways is to use proper caching mechanism. Memcached is a high performance <key, value> distributed cache. High frequently used data and costly data (cost is with respect to time to decompress) is stored in memcached server node. Data is not persistent in memcached server node. In distributed non persistence caching environment, durability of high frequently used data and costly data should be high in order to achieve high availability. Frequency of data being accessed, time to decompress the data and number of write operations in distributed server nodes are the key characteristics that needs to be considered in order to decide the durability value of the data. MemcacheS server node acts as a central entity. It creates replication of data in distributed memcached server nodes based on value of durability. In data read operation, memcacheS server node provides information to client node about memcached server nodes which have data. After failure of any memcached server node, value of stored data could be retrieved from other memcached server node with durability of data more than 1. The results indicate that, availability of data is increased, as it can be fetched from other memcached server nodes too. Durable data storage provides high availability of the data in non persistence caching environment.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131772031","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

Fine grain thread scheduling on multicore processors: cores with multiple functional units 多核处理器上的细粒度线程调度:具有多个功能单元的核

Compute Pub Date : 2013-08-22 DOI: 10.1145/2522548.2523137

M. Bhatia, D. Kiran, J. P. Misra, S. Gurunarayanan

{"title":"Fine grain thread scheduling on multicore processors: cores with multiple functional units","authors":"M. Bhatia, D. Kiran, J. P. Misra, S. Gurunarayanan","doi":"10.1145/2522548.2523137","DOIUrl":"https://doi.org/10.1145/2522548.2523137","url":null,"abstract":"The proposed work discusses a global scheduling technique for multicore processors with specific focus on processor cores having multiple functional units. The design philosophy of the multicore architecture is to accommodate more cores with more execution capabilities on a chip by reducing other complex and redundant circuits. Due to the simplicity of hardware on the chip of multicore processor, the onus of detecting and exploiting the instruction level parallelism (ILP) in the program lies on the complier. Following work proposes a scheduling technique which is used to schedule the instructions onto multiple cores on chip each having multiple functional units. The goal is achieved by dissecting each basic block of the program's control flow graph (CFG) into sub-divisions called sub-blocks. These sub-blocks are then analyzed for the break-up of instructions on the basis of instruction type (Integer or Floating Point) and then they are scheduled onto different cores while trying to get a balanced trade-off between communication costs amongst the cores. The scheduler provides enough or approximately equal number of integer and floating point instructions to each core which may be executed in parallel on the core's multiple functional units (integer unit and floating point units), thus taking advantage of the core's architecture.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134090628","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}

引用次数: 1

Empirical study of performance benefits of hardware assisted virtualization 硬件辅助虚拟化的性能优势的实证研究

Compute Pub Date : 2013-08-22 DOI: 10.1145/2522548.2522598

R. Ganesan, Yogesh Murarka, S. Sarkar, Kristoffer M. Frey

{"title":"Empirical study of performance benefits of hardware assisted virtualization","authors":"R. Ganesan, Yogesh Murarka, S. Sarkar, Kristoffer M. Frey","doi":"10.1145/2522548.2522598","DOIUrl":"https://doi.org/10.1145/2522548.2522598","url":null,"abstract":"An application's performance can suffer from significant computational overheads when it is moved from a native to a virtualized environment. Adoption of virtualization without understanding such overheads in detail can dramatically impact the overall performance of hosted applications. The rapid adoption of virtualization has fueled the development of new hardware technologies, which promise to optimize the performance and scalability of processor and network I/O virtualization. However, no comprehensive empirical study of the effectiveness of these hardware assistance technologies is publicly available. In this paper we focus on x86 architectures and study empirically the performance improvements introduced by Intel's VT and PCI-SIG's SR-IOV on a Xen-based hypervisor. Using a range of benchmark programs, we compare benchmark scores and resource utilization between native and virtual environments for two different testbeds, one with hardware assistance and one without. The results indicate that hardware assistance indeed eliminates most overheads, especially those relating to network I/O, but non-negligible CPU overheads still remain. Also, there is no hardware technology with specifically deals with disk I/O virtualization, and significant overheads do arise in workloads requiring intensive disk usage.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"914 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123275301","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

Upgradation of business applications with autonomic computing 使用自主计算升级业务应用程序

Compute Pub Date : 2013-08-22 DOI: 10.1145/2522548.2522604

D. Kurian, P. Chelliah

{"title":"Upgradation of business applications with autonomic computing","authors":"D. Kurian, P. Chelliah","doi":"10.1145/2522548.2522604","DOIUrl":"https://doi.org/10.1145/2522548.2522604","url":null,"abstract":"Autonomic computing has come a long way since its inception a decade ago and has been positioned as a venerable and value-adding technology for producing and sustaining self-managing, real-time, and resilient systems for the future. A series of concerted efforts by multiple IT companies and academic research laboratories across the world have brought in a number of advancements in this discipline with vigorous study and research. A variety of proven and potential mathematical and computational concepts have been selected and synchronized to arrive at noteworthy improvements in the autonomic systems design, development, deployment, and delivery methods. Having understood the unique value-proposition and the significant achievements in the autonomic computing space, business executives and IT experts are consciously embracing the autonomic idea, which is very generic to be easily embedded in any kind of business and IT systems. However, the penetration of this technology into both IT and business applications has not been as originally envisaged by its creators due to various reasons.\u0000 The business environment is still filled and saturated with large-scale packaged and monolithic applications. If the autonomic capabilities are innately squeezed into business and IT applications, then there can be major differentiators in how those applications function in seamlessly and spontaneously automating business operations. Both, existing as well as emerging applications can be targeted to become autonomic in their operations, outputs, and outlooks. In this paper, we have described how the leading enterprise packages (ERP, CRM, SCM, and so on.) can be enabled to be adaptive, highly available, secure, and scalable in their actions and reactions. The well-known enterprise applications such as CRM, Online Retail, and Marketing with focus on self-optimization characteristics are described here. A detailed analysis of a Discount Manager in an online retail scenario is also explained. The simulation results obtained clearly show how embedded autonomic capability is very close to human thinking and decision-making ability.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128951342","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

A comparative study of Monte Carlo methods to compute rare event probabilities of failure in reliability models 计算可靠性模型中罕见事件失效概率的蒙特卡罗方法的比较研究

Compute Pub Date : 2013-08-22 DOI: 10.1145/2522548.2522600

Gopichand Agnihotram, H. M. Koduvely

引用次数: 2