32,270 Hits in 6.6 sec

Fault-local distributed mending (extended abstract)

Shay Kutten, David Peleg
1995 Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95  
As communication networks grow,  ...  In this case, any processor detecting an inconsistency broadcasts a message to this effect throughout the entire network.  ...  The example above demonstrates also a curious property implied by the definition of fault locality. Consider a locally f-mendable problem X.  ... 
doi:10.1145/224964.224967 dblp:conf/podc/KuttenP95 fatcat:dcti5rchsba7xo3pftlzrinx4q

Memory-efficient and self-stabilizing network RESET (extended abstract)

Baruch Awerbuch, Rafail Ostrovsky
1994 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94  
In this paper we consider the question of fault-tolerant distributed network protocols with extremely small memory requirements per processor.  ...  In particular, we show that even in the case of worst-case transient faults i.e., in a self-stabilizing setting, many fundamental network protocols can be achieved using only Olog n bits of memory per  ...  The global state s of the network is a Cartesian product of the states of all the processors and the channels.  ... 
doi:10.1145/197917.198104 dblp:conf/podc/AwerbuchO94 fatcat:q6mrjynhrvfjtizawkcajaowhi

Self-stabilizing symmetry breaking in constant-space (extended abstract)

Alain Mayer, Yoram Ofek, Rafail Ostrovsky, Moti Yung
1992 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92  
machines of size independent of the size of the network.  ...  Requiring only constant-size messages and message-passing model has practical implications: our solution can be implemented in high-speed networks using a universal fast hardware switches i.e., nite state  ...  Acknowledgments We are happy to thank Yehuda Afek, Baruch A w erbuch, Amotz Bar-Noy, Shay Kutten, Sergio Rajsbaum, and Baruch Schieber for helpful discussions.  ... 
doi:10.1145/129712.129777 dblp:conf/stoc/MayerOOY92 fatcat:2prmlah2fjaq3j6xh4h4n73uoi

Assigning labels in unknown anonymous networks (extended abstract)

Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stéphane Pérennes
2000 Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing - PODC '00  
., the number of rounds required for the label assignment, and the message and bit complexities of the label assignment protocol, i.e., the total number of messages (resp., bits) circulating in the network  ...  A priori, nodes do not have any identities (anonymous network) and do not know the topology or the size of the network (unknown network).  ...  The impossibility of distinguishing processors yields symmetry in computations and restricts the computational power of the network.  ... 
doi:10.1145/343477.343527 dblp:conf/podc/FraigniaudPPP00 fatcat:zokd4p2d2bbwzajsdpfsnozcpa

A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing⋆ (Extended Abstract) [chapter]

Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci
1999 Lecture Notes in Computer Science  
We apply our methodology to assess the portability of enhanced variants of the BSP model with respect to processor networks, with particular emphasis on multidimensional arrays. ?  ...  In this paper, we propose and begin to explore a methodology for studying effectiveness and portability in a quantitative way. Namely, in Section 2 we argue that, if a model  ...  Each superstep embodies a phase where processors compute on locally available data, a phase where processors exchange messages, and a phase of global synchronization.  ... 
doi:10.1007/3-540-48311-x_76 fatcat:hmhiyzvakjfhja7yqamhx5uw2y

Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract) [chapter]

Zvi Galil, Stuart Haber, Moti Yung
1988 Lecture Notes in Computer Science  
Supported in part by NSF grants MCS-8303139 and DCR-8511713. Supported in part by an IBM graduate fellowship.  ...  We model the most general sort of feasible adversarial behavior, and describe fault-recovery procedures that can tolerate it. Our constructions minimize the use of cryptographic resources.  ...  Acknowledgements We would like to thank Silvio Micali for introducing us to this area of research and for many helpful discussions, and Cynthia Dwork for her careful critical remarks, as well as the members  ... 
doi:10.1007/3-540-48184-2_10 fatcat:ghzpsdxxjfa5hd2lysht6zonpu

Timed Simulation of Extended AADL-Based Architecture Specifications with Timed Abstract State Machines [chapter]

Stefan Björnander, Lars Grunske, Kristina Lundqvist
2009 Lecture Notes in Computer Science  
This paper presents an extension to AADL's behavior model using time annotations in order to improve the evaluation of timing properties in AADL.  ...  The Architecture Analysis and Design Language (AADL) is a popular language for architectural modeling and analysis of software intensive systems in application domains such as automotive, avionics, railway  ...  In detail, this paper describes a translational semantic that maps the extended behavior specifications of AADL into a network of timed abstract state machines.  ... 
doi:10.1007/978-3-642-02351-4_7 fatcat:bv3njyfwjve2zkiwaavryd4d7e

Leveraging intersections in management theory and practice (Extended Abstracts)

2021 Sinergie Italian Journal of Management  
Balancing theory and practice: a review of the state of PLS-SEM research by the community of Italian management scholars FRANCESCA MAGNO, FABIO CASSIA " Co-creation of value in Open Innovation: does coopetition  ...  for the "Made in Italy" : the case of digital craftsmanship at design italian shoes CHIARA GROSSO, CARLO AMENTA " Industry 5.0 and Business model innovation in SMEs: an explorative study on the Role of  ...  LI L. (2018), "Blockchain-Based Solutions to Security and Privacy Issues in the Internet of Things", IEEE Wireless Communications, vol. 22, n. 6,.  ... 
doi:10.7433/srecp.ea.2021.01 fatcat:l2upsdqpqvc3zgahty45hquici

Enabling Hierarchical Exploration for Large-Scale Multidimensional Data with Abstract Parallel Coordinates

Gaëlle Richer, Joris Sansen, Frédéric Lalanne, David Auber, Romain Bourqui
2018 International Conference on Extending Database Technology  
As data collection grows more common in various domains, there is a call for adapted or newer methods of visualization to tackle magnitudes exceeding the number of available pixels on screens and challenging  ...  For this representation, defining abstractions and interactively generating levels is not straightforward.  ...  ACKNOWLEDGMENTS This work has been carried out as part of the "REQUEST" (PIAO18062-645401) and "SpeedData" (PIAO17298-398711) projects supported by the French "Investissement d'Avenir" Program (Big Data  ... 
dblp:conf/edbt/RicherSLAB18 fatcat:ab5ibxqojrcc5eyoj6w2eigwc4

Second skin

Dennis R. Miaw, Ramesh Raskar
2009 Proceedings of the 27th international conference extended abstracts on Human factors in computing systems - CHI EA '09  
Such a system would track a user's body and limb movements as he or she performs an action, and then give the user automatic, real-time tactile feedback to aid in the correction of movement and position  ...  This thesis details the development of a robust and low-cost optical 3D motion capture system along with versatile and flexible tactile feedback hardware.  ...  in terms of the global coordinate system to the joint coordinate system expressed in terms of the global coordinate system.  ... 
doi:10.1145/1520340.1520696 dblp:conf/chi/MiawR09 fatcat:3epl3bfexrbfzftb7t5vsbzbym

Building BSP programs using the refinement calculus [chapter]

D. B. Skillicorn
1998 Lecture Notes in Computer Science  
We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style.  ...  This demonstrates that formal approaches developed for sequential computing can be generalised to (some) parallel computing environments, and may be useful for managing some of the details of programming  ...  Computations are expressed in supersteps which consist of local computations in each processor, using only local values, and global communication actions, whose results take effect locally only at the  ... 
doi:10.1007/3-540-64359-1_742 fatcat:osvc4efxuraipgac6jkzp5c6gm

Reflective HCI

Paul Dourish, Janet Finlay, Phoebe Sengers, Peter Wright
2004 Extended abstracts of the 2004 conference on Human factors and computing systems - CHI '04  
In extending this work to the responsive media environment of the TGarden, the relation is not limited to the rhythm of one body with another, but of one body with the salient responsive elements in the  ...  ABSTRACT Working from literary theory, in this position paper I propose The Uncanny as strategy for a critical approach to the design of robots.  ...  ACKNOWLEDGEMENTS This work is sponsored in part by NSF Award #0238132.  ... 
doi:10.1145/985921.986203 dblp:conf/chi/DourishFSW04 fatcat:2riaoweryzhnza25n4hwbghwha

Model-based design and distributed implementation of bus arbiter for multiprocessors

Imene Ben-Hafaiedh, Susanne Graf, Mohamad Jaber
2011 2011 18th IEEE International Conference on Electronics, Circuits, and Systems  
Our model provides a way for describing several existing arbitration protocols in a distributed and abstract manner so that their properties and performance could be easily compared and analyzed.  ...  The contribution of this paper is twofold. First we propose a high-level distributed and abstract model of the bus arbiter for multiprocessors.  ...  The BIP model of this protocol is depicted in Figure 1 -a, where we provide the description of a network of 3 processors and which can be naturally extended to N processors.  ... 
doi:10.1109/icecs.2011.6122215 dblp:conf/icecsys/HafaiedhGJ11 fatcat:7gp4cq2msjgxhobotpvmxw2rua

A Theoretical Model for Global Optimization of Parallel Algorithms

Julian Miller, Lukas Trümper, Christian Terboven, Matthias S. Müller
2021 Mathematics  
It utilizes a hierarchical decomposition of parallel design patterns as well-established building blocks for algorithmic structures and captures them in an abstract pattern tree (APT).  ...  We present a parallel algorithm model that allows for global optimization of their synchronization and dataflow and optimal mapping to complex and heterogeneous architectures.  ...  In this context, the abstract term processor refers to any homogeneous group of cores sharing the same processor-local cache.  ... 
doi:10.3390/math9141685 fatcat:disxmrpqtfa7fbwt6n7cuyqz7q


Leah Buechley, Daniela K. Rosner, Eric Paulos, Amanda Williams
2009 Proceedings of the 27th international conference extended abstracts on Human factors in computing systems - CHI EA '09  
of DIY Social implications of DIY DIY and education DIY communities DIY and marginalized groups DIY in developing countries  ...  Topics include but are not limited to: and handiwork Sustainable practices Reuse, repair and economic necessity Open source software Open source hardware Political implications of DIY Economic implications  ...  In a pinch, you can change babies anywhere you can lay them down, but long term, for the sake of your back, waist height is best.  ... 
doi:10.1145/1520340.1520750 dblp:conf/chi/BuechleyRPW09 fatcat:zbmldbatmngh3par3o62bldo4y
« Previous Showing results 1 — 15 out of 32,270 results