Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity最新文献_第2页

Dictionary-based query recommendation for local code search 基于字典的本地代码搜索查询推荐

Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity Pub Date : 2013-10-26 DOI: 10.1145/2508075.2522609

Xi Ge

引用次数: 0

Hardware and software support for fine-grained memory access control and encapsulation in C++ 硬件和软件支持细粒度内存访问控制和封装在c++中

Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity Pub Date : 2013-10-26 DOI: 10.1145/2508075.2508091

Eugen Leontie, Gedare Bloom, R. Simha

引用次数: 0

Declarative programming for the cloud 面向云的声明式编程

Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity Pub Date : 2013-10-26 DOI: 10.1145/2508075.2508190

M. Aref

引用次数: 0

Effective use of non-blocking data structures in a deduplication application 在重复数据删除应用程序中有效地使用非阻塞数据结构

Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity Pub Date : 2013-10-26 DOI: 10.1145/2508075.2508431

S. Feldman, Akshatha Bhat, P. Laborde, Qing Yi, D. Dechev

{"title":"Effective use of non-blocking data structures in a deduplication application","authors":"S. Feldman, Akshatha Bhat, P. Laborde, Qing Yi, D. Dechev","doi":"10.1145/2508075.2508431","DOIUrl":"https://doi.org/10.1145/2508075.2508431","url":null,"abstract":"Efficient multicore programming demands fundamental data structures that support a high degree of concurrency. Existing research on non-blocking data structures promises to satisfy such demands by providing progress guarantees that allow a significant increase in parallelism while avoiding the safety hazards of lock-based synchronizations. It is well-acknowledged that the use of non-blocking containers can bring significant performance benefits to applications where the shared data experience heavy contention. However, the practical implications of integrating these data structures in real-world applications are not well-understood. In this paper, we study the effective use of non-blocking data structures in a data deduplication application which performs a large number of concurrent compression operations on a data stream using the pipeline parallel processing model. We present our experience of manually refactoring the application from using conventional lock-based synchronization mechanisms to using a wait-free hash map and a set of lock-free queues to boost the degree of concurrency of the application. Our experimental study explores the performance trade-offs of parallelization mechanisms that rely on a) traditional blocking techniques, b) fine-grained mutual exclusion, and c) lock-free and wait-free synchronization.","PeriodicalId":430425,"journal":{"name":"Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131208650","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}

引用次数: 12

Do language constructs for concurrent execution have impact on energy efficiency? 用于并发执行的语言结构对能源效率有影响吗?

Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity Pub Date : 2013-10-26 DOI: 10.1145/2508075.2514880

G. Pinto

引用次数: 0

The yin and yang of hardware heterogeneity: can software survive? 硬件异构的阴阳:软件能生存吗?

Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity Pub Date : 2013-10-26 DOI: 10.1145/2508075.2508188

K. McKinley

引用次数: 1

Panini: a capsule-oriented programming language for implicitly concurrent program design 一种面向胶囊的编程语言，用于隐式并发程序设计

Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity Pub Date : 2013-10-26 DOI: 10.1145/2508075.2514573

Eric Lin, Hridesh Rajan

{"title":"Panini: a capsule-oriented programming language for implicitly concurrent program design","authors":"Eric Lin, Hridesh Rajan","doi":"10.1145/2508075.2514573","DOIUrl":"https://doi.org/10.1145/2508075.2514573","url":null,"abstract":"This demonstration will present Panini, a new programming language designed with an objective to help programmers with concurrent programming. Current abstractions for concurrency fall into two categories: explicit abstractions for concurrency such as threads, and implicit abstractions for concurrency such as actors.Explicit concurrency abstractions are hard to use, reason about, and error prone. Implicit abstractions like actors help solve these problems, but they require programmers to adapt to the asynchronous style of programming. Many programmers find this adaptation hard. We will demonstrate the notion of capsules in Panini. A capsule is an implicit abstraction for concurrency that has many properties of actors, but provides a logically synchronous programming model to programmers. Main technical challenge in realizing capsules was to maximize concurrency while minimizing overhead and abstracting away all the details of concurrency from the Panini programmer. We will also demonstrate scalability benefits of Panini programs without writing a single line of explicitly parallel code, and compile-time checking of concurrency-related properties such as confinement violation, and sequential consistency.","PeriodicalId":430425,"journal":{"name":"Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126326814","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

Open pattern matching for C++ c++的开放模式匹配

Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity Pub Date : 2013-10-26 DOI: 10.1145/2508075.2508098

Yuriy Solodkyy, G. D. Reis, B. Stroustrup

引用次数: 12

Concurrent object-oriented programming with agents 带有代理的并发面向对象编程

Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity Pub Date : 2013-10-26 DOI: 10.1145/2508075.2508095

A. Ricci, Andrea Santi

引用次数: 0

Automated assessment of students' testing skills for improving correctness of their code 自动评估学生的测试技能，以提高他们代码的正确性

Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity Pub Date : 2013-10-26 DOI: 10.1145/2508075.2508078

Z. Shams

{"title":"Automated assessment of students' testing skills for improving correctness of their code","authors":"Z. Shams","doi":"10.1145/2508075.2508078","DOIUrl":"https://doi.org/10.1145/2508075.2508078","url":null,"abstract":"Although software testing is included as a regular part of many programming courses, current assessment techniques used in automated grading tools for evaluating student-written software tests are imperfect. Code coverage measures are typically used in practice, but that approach does not assess how much of the expected behavior is checked by the tests and sometimes, overestimates the true quality of the tests. Two robust and thorough measures for evaluating student-written tests are running each students' tests against others' solutions(known as all-pairs testing) and injecting artificial bugs to determine if tests can detect them (also known as mutation analysis). Even though they are better indicators of test quality, both of them posed a number of practical obstacles to classroom use. This proposal describes technical obstacles behind using these two approaches in automated grading. We propose novel and practical solutions to apply all-pairs testing and mutation analysis of student-written tests, especially in the context of classroom grading tools. Experimental results of applying our techniques in eight CS1 and CS2 assignments submitted by 147 students show the feasibility of our solution. Finally, we discuss our plan to combine the approaches to evaluate tests of assignments having variable amounts of design freedom and explain their evaluation method.","PeriodicalId":430425,"journal":{"name":"Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121284908","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