检索结果-内蒙古大学图书馆

23rd annual symposium on Parallelism in Algorithms and Architectures

作者： Aspnes, James Ellen, Faith Yale Univ Dept Comp Sci New Haven CT 06520 USA

ISBN: (纸本)9781450307437

We give matching upper and lower bounds of Theta (min (log m/log log m, n)) for the space and individual step complexity of a wait-free m-valued adopt-commit object implemented using multi-writer registers for n anonymous processes. While the upper bound is deterministic, the lower bound holds for randomized adopt-commit objects as well. Our results are based on showing that adopt-commit objects are equivalent, up to small additive constants, to a simpler class of objects that we call weak conflict-detectors. It follows that the same lower bound holds on the individual step complexity of m-valued wait-free anonymous consensus, even for randomized algorithms with global coins against an oblivious adversary. The upper bound can also be used to slightly improve the cost of randomized consensus in the probabilistic-write model.

关键词： distributed computing shared memory anonymity adopt-commit objects conflict detectors consensus

来源：评论

学校读者我要写书评

暂无评论

Fast deterministic consensus in a noisy environment

引用

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC 2002年第1期45卷 16-39页

作者： Aspnes, J Yale Univ Dept Comp Sci New Haven CT 06520 USA

It is well known that the consensus problem cannot be solved deterministically in an asynchronous environment, but that randomized solutions are possible. We propose a new model, called noisy scheduling, in which an adversarial schedule is perturbed randomly, and show that in this model randomness in the environment can substitute for randomness in the algorithm. In particular, we show that a simplified, deterministic version of Chandra's wait-free shared-memory consensus algorithm [Chandra, in: proceedings of the Fifteenth annual acm symposium on principles of distributed computing, Philadelphia, PA, USA, 23-26 May, 1996, pp. 166-175] solves consensus in time at most logarithmic in the number of active processes. The proof of termination is based on showing that a race between independent delayed renewal processes produces a winner quickly. In addition, we show that the protocol finishes in constant time using quantum and priority-based scheduling on a uniprocessor, suggesting that it is robust against the choice of model over a wide range. (C) 2002 Elsevier Science (USA). All rights reserved.

关键词： consensus agreement protocols randomized algorithms distributed computing wait-free shared memory perturbation analysis noisy scheduling

来源：评论

学校读者我要写书评

暂无评论

proceedings of the annual acm symposium on Theory of computing

Proceedings of the Annual ACM Symposium on Theory of Computi...

引用

3rd annual acm symposium on principles of Programming Languages, STOC 1971

The proceedings contain 23 papers. The topics discussed include: formal languages and power series;loop schemata;fast matrix multiplication;linear representation of tree structure;on generalized finite automata and unrestricted generative grammars;some results in tree automata;block structure: retention or deletion;and on the parallel computation of local operations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A framework to process complex biodiversity queries 08

A framework to process complex biodiversity queries

引用

23rd annual acm symposium on Applied computing, SAC'08

作者： Daltio, Jaudete Medeiros, Claudia B. Gomes Jr., Luiz Lewinsohn, Thomas Michael Institute of Computing University of Campinas CP 6176 13084-971 Campinas SP Brazil Institute of Biology University of Campinas CP 6109 13083-970 Campinas SP Brazil

ISBN: (纸本)9781595937537

Tackling biodiversity information is essentially a distributed effort. Data handled are inherently heterogeneous, being provided by distinct research groups and using different vocabularies. Queries in biodiversity systems require to correlate these data, using many kinds of knowledge on geographic, biologic and ecological issues. Available biodiversity systems can only cope with part of these queries, and end users must perform several manual tasks to derive the desired, correlations, because of semantic mismatches among, data sources and lack of appropriate operators. This paper presents a solution based on Web services to meet these challenges. It relies on ontologies to retrieve the query contexts and uses the terms of this context to discover suitable sources in data repositories. This approach is being tested using real data, with new services. Copyright 2008 acm.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

The LATEX legacy

The LATEX legacy

引用

20th annual acm symposium on principles of distributed computing

作者： Rowley, C.

The second edition of The Manual [23] begins: 'LATEX is a system for typesetting documents. Its first widely available version, mysteriously numbered 2.09, appeared in 1985.' It is too early for a complete critical assessment of the impact of LATEX 2.09 because its world-wide effects on many aspects of many cultures, not least scientific publication, remain strong after 15 years - and that itself is significant in a technological world where a mere 15 months of fame can make and break an idea. Therefore this paper provides simply a review and evaluation of the relationship between TEX, LATEX and some of the major technical developments in the world of quality automated formatting since the publication of LATEX 2.09 in 1985. It is neither definitive nor comprehensive but I hope it is informative.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Scara3D: 3-Dimensional HRI integrated to a distributed control architecture for remote and cooperative actuation 08

Scara3D: 3-Dimensional HRI integrated to a distributed contr...

引用

23rd annual acm symposium on Applied computing, SAC'08

作者： Junior, José Martins Junior, Luiz Camolesi Caurin, Glauco A. P. University of São Paulo Av do Trabalhador Sancarlense 400 Centro São Carlos SP Brazil Methodist University of Piracicaba Rodovia do Açúcar 156 Taquaral Piracicaba SP Brazil

ISBN: (纸本)9781595937537

During the last years, service robots have been widely applied in home and office automation tasks. The major challenge faced at present by researchers in this area lies on the capability of humans and robots to share the same environment safely. Despite the fact that several solutions for this problem involving service robots have already been presented, this subject is rarely discussed involving industrial manipulators. In this paper we present a new approach of multilayer architecture for distributed control of manipulator robots. The proposed model describes layers to implement cooperative and collaborative behaviors among robots and human beings based on an appropriate model of rules. The Scara3D, a Human-Robot Interface, is presented as an application for the architecture's Virtual Environment Creator layer. Copyright 2008 acm.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

PROVIDING DEPENDABILITY FOR WEB SERVICES 08

PROVIDING DEPENDABILITY FOR WEB SERVICES

引用

23rd annual acm symposium on Applied computing

作者： Souza, Jeferson L. R. Siqueira, Frank Univ Fed Santa Catarina Distributed Syst Res Lab LaPeSD Dept Informat & Stat INE Florianopolis SC Brazil

ISBN: (纸本)9781595937537

Web services have been widely employed to allow interoperability among applications and/or technologies. However, the standard technologies and protocols which provide the foundation for Web Services do not address issues such as fault tolerance and dependability of services. Aiming to solve this limitation, this paper proposes a software architecture for providing dependability for Web Services. This architecture is responsible for increasing service availability and maintaining all replicas of a service in a consistent, state, having as main characteristic the separation of these replicas in groups.

关键词： Dependability Fault Tolerance Web Services

来源：评论

学校读者我要写书评

暂无评论

Fay: Extensible distributed tracing from kernels to clusters 11

Fay: Extensible distributed tracing from kernels to clusters

引用

23rd acm symposium on Operating Systems principles, SOSP 2011

作者： Erlingsson, Úlfar Peinado, Marcus Peter, Simon Budiu, Mihai Google Inc. United States Microsoft Research Extreme Computing Group United States ETH Zurich Systems Group Switzerland Microsoft Research Silicon Valley United States

ISBN: (纸本)9781450309776

Fay is a flexible platform for the efficient collection, processing, and analysis of software execution traces. Fay provides dynamic tracing through use of runtime instrumentation and distributed aggregation within machines and across clusters. At the lowest level, Fay can be safely extended with new tracing primitives, including even untrusted, fully-optimized machine code, and Fay can be applied to running user-mode or kernel-mode software without compromising system stability. At the highest level, Fay provides a unified, declarative means of specifying what events to trace, as well as the aggregation, processing, and analysis of those events. We have implemented the Fay tracing platform for Windows and integrated it with two powerful, expressive systems for distributed programming. Our implementation is easy to use, can be applied to unmodified production systems, and provides primitives that allow the overhead of tracing to be greatly reduced, compared to previous dynamic tracing platforms. To show the generality of Fay tracing, we reimplement, in experiments, a range of tracing strategies and several custom mechanisms from existing tracing frameworks. Fay shows that modern techniques for high-level querying and data-parallel processing of disaggregated data streams are well suited to comprehensive monitoring of software execution in distributed systems. Revisiting a lesson from the late 1960's [15], Fay also demonstrates the efficiency and extensibility benefits of using safe, statically-verified machine code as the basis for low-level execution tracing. Finally, Fay establishes that, by automatically deriving optimized query plans and code for safe extensions, the expressiveness and performance of high-level tracing queries can equal or even surpass that of specialized monitoring tools. © 2011 acm.

关键词： System stability

来源：评论

学校读者我要写书评

暂无评论

Parallel processing approaches in RET and MDP: New hybrid multithreading and distributed technology for optimum throughput in a hierarchical flow

Parallel processing approaches in RET and MDP: New hybrid mu...

引用

23rd annual BACUS symposium on Photomask Technology

作者： Schulze, S Sahouria, E Todd, R Grodd, L Finch, M Mentor Graph Corp Wilsonville OR USA

ISBN: (纸本)0819451436

The continuous integration trend in design and broad deployment of resolution enhancement techniques (RET) have a tremendous impact on circuit file size and pattern complexity. Increasing design cycle time has drawn attention to the data manipulation steps that follow the physical layout of the design. The contributions to the total turn-around time for a design are twofold: the time to get the data ready for the hand-off to the mask writer is growing, but also the time it takes to write the mask is heavily influenced by the size and complexity of the data. In order to reduce the time that is required for the application of RET and the export of the data to mask writer formats, massively parallel processing approaches have been described. This paper presents such computing algorithms for the hierarchical implementation of RET and mask data preparation (MDP). We focus on the parallel and flexible deployment of a new hybrid multithreaded and distributed processing scheme in homogeneous and heterogeneous computer networks called MTFlex. We describe the new methodology and discuss corresponding hardware and software configurations. The application of this i MTFlexi computing scheme to different tasks in post-tapeout data preparation is shown in examples.

关键词： Resolution enhancement technologies Parallel processing Photomasks Computer networks Data processing distributed computing Manufacturing Data storage Databases Visualization

来源：评论

学校读者我要写书评

暂无评论

On the Pigeonhole and Related principles in Deep Inference and Monotone Systems 14

On the Pigeonhole and Related Principles in Deep Inference a...

引用

Joint Meeting of the 23rd EACSL annual Conference on Computer Science Logic (CSL) / 29th annual acm/IEEE symposium on Logic in Computer Science (LICS)

作者： Das, Anupam INRIA Rocquencourt France Univ Bath Bath Avon England

ISBN: (纸本)9781450328869

We construct quasipolynomial-size proofs of the propositional pigeonhole principle in the deep inference system KS, addressing an open problem raised in previous works and matching the best known upper bound for the more general class of monotone proofs. We make significant use of monotone formulae computing boolean threshold functions, an idea previously considered in works of Atserias et al. The main construction, monotone proofs witnessing the symmetry of such functions, involves an implementation of merge-sort in the design of proofs in order to tame the structural behaviour of atoms, and so the complexity of normalization. Proof transformations from previous work on atomic flows are then employed to yield appropriate KS proofs. As further results we show that our constructions can be applied to provide quasipolynomial-size KS proofs of the parity principle and the generalized pigeonhole principle. These bounds are inherited for the class of monotone proofs, and we are further able to construct n(O(log log n))-size monotone proofs of the weak pigeonhole principle with (1 + epsilon)n pigeons and n holes for epsilon = 1= log(k) n, thereby also improving the best known bounds for monotone proofs.

关键词： Pigeonhole Principle Deep Inference Monotone Proofs Atomic Flows

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：