The proceedings contain 61 papers. The topics discussed include: random walks which prefer unvisited edges: exploring high girth even degree expanders in linear time;coalescing random walks and voting on graphs;the co...
ISBN:
(纸本)9781450314503
The proceedings contain 61 papers. The topics discussed include: random walks which prefer unvisited edges: exploring high girth even degree expanders in linear time;coalescing random walks and voting on graphs;the cost of fault tolerance in multi-party communication complexity;the communication complexity of distributed task allocation;collaborative search on the plane without communication;universal constructions that ensure disjoint-access parallelism and wait-freedom;generalized lattice agreement;distributed selfish load balancing with weights and speeds;making evildoers pay: resource-competitive broadcast in sensor networks;distributed public key schemes secure against continual leakage;weak models of distributedcomputing, with connections to modal logic;aggregation in dynamic networks;leader election in shared spectrum radio networks;and breaking the O(nm) bit barrier, secure multiparty computation with a static adversary.
The proceedings contain 137 papers. The topics discussed include: computational thinking for all: the power and the peril;lab of things: a devices research and teaching platform for home and beyond;increasing the effe...
ISBN:
(纸本)9781450326056
The proceedings contain 137 papers. The topics discussed include: computational thinking for all: the power and the peril;lab of things: a devices research and teaching platform for home and beyond;increasing the effectiveness of automated assessment by increasing marking granularity and feedback units;can computers compare student code solutions as well as teachers?;an experience report on using gamification in technical higher education;how (not) to introduce badges to online exercises;course-embedded research in software development courses;student projects are not throwaways: teaching practical software maintenance in a software engineering course;Syrus: providing practice problems in discrete mathematics with instant feedback;teaching theoretical computer science using a cognitive apprenticeship approach;bringing CS2013 recommendations for parallel and distributedcomputing into your CS curriculum;and toward curricular guidelines for cybersecurity.
The proceedings contain 30 papers. The topics discussed include: taming massive distributed datasets: data sampling using bitmap indices;MTC envelope: defining the capability of large scale computers in the context of...
详细信息
ISBN:
(纸本)9781450319102
The proceedings contain 30 papers. The topics discussed include: taming massive distributed datasets: data sampling using bitmap indices;MTC envelope: defining the capability of large scale computers in the context of parallel scripting applications;virtual TCP offload: optimizing Ethernet overlay performance on advanced interconnects;scalanytics: a declarative multi-core platform for scalable composable traffic analytics;NUMA-aware shared-memory collective communication for MPI;ACIC: automatic cloud I/O configurator for parallel applications;orthrus: a framework for implementing high-performance collective I/O in the multicore clusters;supporting parallel soft real-time applications in virtualized environment;building and scaling virtual clusters with residual resources from interactive clouds;and SCDA: SLA-aware cloud datacenter architecture for efficient content storage and retrieval.
In this talk I will address one of the most relevant challenges for a decade to come: How to design, model, and execute distributed systems utilizing the Internet of Things, software services, as well as human based s...
详细信息
ISBN:
(纸本)9781450325776
In this talk I will address one of the most relevant challenges for a decade to come: How to design, model, and execute distributed systems utilizing the Internet of Things, software services, as well as human based services, considering modern Cloud computing and Elasticity principles. Elasticity is seen as one of the main characteristics of Cloud computing today. Is elasticity simply scalability on steroids? In this talk I will discuss the main principles of elasticity, present a fresh look at this problem, and examine how to integrate people, software services, and things into one composite system, which can be modeled, programmed, and deployed on a large scale in an elastic way.
In this paper, we study the interaction times of continuous distributed interactive computing in which the application states change due to not only user-initiated operations but also time passing. We formulate the Mi...
详细信息
ISBN:
(纸本)9781450320658
In this paper, we study the interaction times of continuous distributed interactive computing in which the application states change due to not only user-initiated operations but also time passing. We formulate the Minimum Interaction Time problem as a combinatorial problem of how the clients are assigned to the servers and the simulation time settings of the servers. We also outline two approaches to approximate the problem. Copyright 2013acm.
A new model that depicts a network of randomized finite state machines operating in an asynchronous environment is introduced. This model, that can be viewed as a hybrid of the message passing model and cellular autom...
详细信息
ISBN:
(纸本)9781450320658
A new model that depicts a network of randomized finite state machines operating in an asynchronous environment is introduced. This model, that can be viewed as a hybrid of the message passing model and cellular automata is suitable for applying the distributedcomputing lens to the study of networks of sub-microprocessor devices, e.g., biological cellular networks and man-made nano-networks. Although the computation and communication capabilities of each individual device in the new model are, by design, much weaker than those of an abstract computer, we show that some of the most important and extensively studied distributedcomputing problems can still be solved efficiently. Copyright 2013acm.
We advocate rigorous system design as a coherent and accountable model-based process leading from requirements to implementations. We present the state of the art in system design, discuss its current limitations, and...
详细信息
ISBN:
(纸本)9781450329446
We advocate rigorous system design as a coherent and accountable model-based process leading from requirements to implementations. We present the state of the art in system design, discuss its current limitations, and identify possible avenues for overcoming them. A rigorous system design flow [3] is defined as a formal accountable and iterative process composed of steps, and based on four principles: (1) separation of concerns; (2) component-based construction; (3) semantic coherency; and (4) correctness-by-construction. We show that the combined application of these principles allows the definition of rigorous design flows clearly identifying where human intervention and ingenuity are needed to resolve design choices, as well as activities that can be supported by tools to automate tedious and error-prone tasks. An implementable system model is progressively derived by source-to-source automated transformations in a single host component-based language rooted in well-defined semantics. Using a single modeling language throughout the design flow enforces semantic coherency. Correct-by-construction techniques allow well-known limitations of a posteriori verification to be overcome and ensure accountability. It is possible to explain, at each design step, which among the requirements are satisfied and which may not be *** presented view has been amply implemented in the BIP (Behavior, Interaction, Priority) component framework and substantiated by numerous experimental results showing both its relevance and feasibility [1]. We show in particular, how distributed implementations can be generated from BIP models with multiparty interactions by application of correct-by-construction transformations [2]. We conclude with a discussion advocating a system-centric vision for computing, identifying possible links with other disciplines, and emphasizing centrality of system design.
Parallelism pervades all aspects of modern computing, from in-home devices such as cell phones to large-scale supercomputers. Recognizing this - and motivated by the premise that every undergraduate student in a compu...
详细信息
ISBN:
(纸本)9781450326056
Parallelism pervades all aspects of modern computing, from in-home devices such as cell phones to large-scale supercomputers. Recognizing this - and motivated by the premise that every undergraduate student in a computer-related field should be prepared to cope with parallel computing - a working group sponsored by NSF and IEEE/TCPP, and interacting with the acm CS2013 initiative, has developed guidelines for assimilating parallel and distributedcomputing (PDC) into the core undergraduate curriculum. Over 100 Early-Adopter institutions worldwide are currently modifying their computer-related curricula in response to the guidelines. Additionally, the CDER Center for Curriculum Development and Educational Resources, which grew out of the working group, is currently assembling a book of contributed essays on how to teach PDC topics in lower-level CS/CE courses, to fill the serious lack of textual material for students and *** session is intended: (i) to report on the current state of this initiative; (ii) to bring together authors of book chapters and Early Adopters and other interested parties for discussions on ongoing activities and needs; (iii) to discuss the initiative and collect direct feedback from the community.
The distributed systems research community has developed many provably correct algorithms and abstractions that are in wide use. However, practical implementations of distributed systems often contain many bugs, and p...
详细信息
ISBN:
(纸本)9781450320658
The distributed systems research community has developed many provably correct algorithms and abstractions that are in wide use. However, practical implementations of distributed systems often contain many bugs, and practitioners spend much of their time troubleshooting these bugs. In this paper we present an algorithm, retrospective causal inference, to ease the burden of troubleshooting. We end by enumerating several open research problems related to the troubleshooting process. Copyright 2013acm.
The M-renaming task requires n+1 processes, each starting with a unique input name (from an arbitrary large range), to coordinate the choice of new output names from a range of size M. This paper presents the first up...
详细信息
ISBN:
(纸本)9781450320658
The M-renaming task requires n+1 processes, each starting with a unique input name (from an arbitrary large range), to coordinate the choice of new output names from a range of size M. This paper presents the first upper bound on the complexity of hard renaming, i.e., 2n-renaming, when n + 1 is not a prime power. It is known that 2n-renaming can be solved if and only if n+1 is not a prime power;however, the previous proof of the "if" part was non-constructive, involving an approximation theorem;in particular, it did not yield a concrete upper bound on the complexity of the resulting protocol. Copyright 2013acm.
暂无评论