The authors study the parallel implementation of a traditional frame-based knowledge representation system for a general-purpose massively parallel hypercube architecture (such as the Connection Machine). It is shown ...
详细信息
The authors study the parallel implementation of a traditional frame-based knowledge representation system for a general-purpose massively parallel hypercube architecture (such as the Connection Machine). It is shown that, using a widely available parallel system (instead of a special-purpose architecture), it is possible to provide multiple users with efficient shared access to a large-scale knowledge-base. parallel algorithms are presented for answering multiple inference assert, and retract queries on both single and multiple inheritance hierarchies. In addition to theoretical time complexity analysis, empirical results obtained from extensive testing of a prototype implementation are presented.< >
Identification, characterization, and construction of fault patterns that are catastrophic for linear systolic arrays are discussed. It is shown that for a given link configuration in the array, it is possible to iden...
详细信息
Identification, characterization, and construction of fault patterns that are catastrophic for linear systolic arrays are discussed. It is shown that for a given link configuration in the array, it is possible to identify all PE (processing element) catastrophic fault patterns. The requirement on the minimum number of faults in a fault pattern and its spectrum (spread out) for it to be catastrophic is shown to be a function of the length of the longest bypass link available, and not of the total number of bypass links. The paper also gives bounds on the width of a catastrophic fault spectrum.< >
In this paper, we present a systolic algorithm for computing the configuration space of an arrangement of arbitrary obstacles in the plane for a rectilinearly convex robot. The obstacles and the robot are assumed to b...
详细信息
In this paper, we present a systolic algorithm for computing the configuration space of an arrangement of arbitrary obstacles in the plane for a rectilinearly convex robot. The obstacles and the robot are assumed to be represented in digitized form by a √ n × √ n nibary image. The algorithm is designed for a Mesh-of-Processors architecture with n processors (using the canonical representation of an image on a processor array) and has an execution time of O(√ n ) which is asymptotically optimal.
A systolic screen of size M is a √M × √M mesh-of-processors where each processing element Pij represents the pixel (i,j) of a digitized plane П of √M × √M pixels. In this paper we study the computation ...
详细信息
An efficient branch and bound algorithm for fine-grained hypercube multiprocessors is presented. The method uses a global storage allocation scheme where all processors collectively store all back-up paths such that e...
详细信息
An efficient branch and bound algorithm for fine-grained hypercube multiprocessors is presented. The method uses a global storage allocation scheme where all processors collectively store all back-up paths such that each processor needs to store only a constant amount of information. At each iteration of the algorithm, all nodes of the current back-up tree may decide whether they need to create new children, be pruned, or remain unchanged. An algorithm that, on the basis of these decisions, updates the current back-up tree and distributes global information in O(log m) steps, where m is the current number of nodes, is described. This method also provides a dynamic allocation mechanism that obtains optimal load balancing. Another important property of the method is that, even if very drastic changes in the current back-up tree occur, the performance of the load balancing mechanism remains constant. The method is currently being implemented on the Connection Machine.< >
Microservice architectures are increasingly used to modularize IoT applications and deploy them in distributed and heterogeneous edge computing environments. Over time, these microservice-based IoT applications are su...
详细信息
Microservice architectures are increasingly used to modularize IoT applications and deploy them in distributed and heterogeneous edge computing environments. Over time, these microservice-based IoT applications are susceptible to performance anomalies caused by resource hogging (e.g., CPU or memory), resource contention, etc., which can negatively impact their Quality of Service and violate their Service Level Agreements. Existing research on performance anomaly detection for edge computing environments focuses on model training approaches that either achieve high accuracy at the expense of a time-consuming and resource-intensive training process or prioritize training efficiency at the cost of lower accuracy. To address this gap, while considering the resource constraints and the large number of devices in modern edge platforms, we propose two clustering-based model training approaches: (1) intra-cluster parameter transfer learning-based model training (ICPTL) and (2) cluster-level model training (CM). These approaches aim to find a trade-off between the training efficiency of anomaly detection models and their accuracy. We compared the models trained under ICPTL and CM to models trained for specific devices (most accurate, least efficient) and a single general model trained for all devices (least accurate, most efficient). Our findings show that ICPTL’s model accuracy is comparable to that of the model per device approach while requiring only 40% of the training time. In addition, CM further improves training efficiency by requiring 23% less training time and reducing the number of trained models by approximately 66% compared to ICPTL, yet achieving a higher accuracy than a single general model.
This book constitutes the proceedings of the 4th International Conference on Social Informatics, SocInfo 2012, held in Lausanne, Switzerland, in December 2012. The 21 full papers, 18 short papers included in this vol...
详细信息
ISBN:
(数字)9783642353864
ISBN:
(纸本)9783642353857
This book constitutes the proceedings of the 4th International Conference on Social Informatics, SocInfo 2012, held in Lausanne, Switzerland, in December 2012.
The 21 full papers, 18 short papers included in this volume were carefully reviewed and selected from 61 submissions. The papers are organized in topical sections named: social choice mechanisms in the e-society,computational models of social phenomena, social simulation, web mining and its social interpretations, algorithms and protocols inspired by human societies, socio-economic systems and applications, trust, privacy, risk and security in social contexts.
Welcome to the proceedings of GCC2004 and the city of Wuhan. Grid computing has become a mainstream research area in computerscience and the GCC conference has become one of the premier forums for presentation of new...
详细信息
ISBN:
(数字)9783540302070
ISBN:
(纸本)9783540235781
Welcome to the proceedings of GCC2004 and the city of Wuhan. Grid computing has become a mainstream research area in computerscience and the GCC conference has become one of the premier forums for presentation of new and exciting research in all aspectsofgridandcooperativecomputing. Theprogramcommitteeispleasedtopresent the proceedings of the 3rd International Conference on Grid and Cooperative Comp- ing (GCC2004), which comprises a collection of excellent technical papers, posters, workshops, and keynote speeches. The papers accepted cover a wide range of exciting topics, including resource grid and service grid, information grid and knowledge grid, grid monitoring,managementand organizationtools, grid portal, grid service, Web s- vices and their QoS, service orchestration, grid middleware and toolkits, software glue technologies, grid security, innovative grid applications, advanced resource reservation andscheduling,performanceevaluationandmodeling,computer-supportedcooperative work, P2P computing, automatic computing, and meta-information management. The conference continues to grow and this year a record total of 581 manuscripts (including workshop submissions) were submitted for consideration. Expecting this growth, the size of the program committee was increased from 50 members for GCC 2003 for 70 in GCC 2004. Relevant differences from previous editions of the conf- ence: it is worth mentioning a signi?cant increase in the number of papers submitted by authors from outside China; and the acceptance rate was much lower than for p- vious GCC conferences. From the 427 papers submitted to the main conference, the program committee selected only 96 regular papers for oral presentation and 62 short papers for poster presentation in the program.
The Transactions on Pattern Languages of Programming subline aims to publish papers on patterns and pattern languages as applied to software design, development, and use, throughout all phases of the software life cyc...
详细信息
ISBN:
(数字)9783642194320
ISBN:
(纸本)9783642194313
The Transactions on Pattern Languages of Programming subline aims to publish papers on patterns and pattern languages as applied to software design, development, and use, throughout all phases of the software life cycle, from requirements and design to implementation, maintenance and evolution. The primary focus of this LNCS Transactions subline is on patterns, pattern collections, and pattern languages themselves. The journal also includes reviews, survey articles, criticisms of patterns and pattern languages, as well as other research on patterns and pattern languages.
This book, the second volume in the Transactions on Pattern Languages of Programming series, presents five papers that have been through a careful peer review process involving both pattern experts and domain experts. The papers demonstrate techniques for applying patterns in an industrial or research setting. Some have confronted the topic within software engineering; others offer approaches in other pattern domains, which is an indication of the diverse fields where patterns are applied.
暂无评论