A BRIEF ANNOUNCEMENT FROM THE INTERIM HONORARY TREASURER

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Brief Announcement: Multicoordinated Paxos∗

In the consensus problem, processes must agree on a single value, given a set of proposals. It is used, for example, to implement statemachine replication [4], in which failure-independent processors are replicated to implement a reliable service. In this approach, the states of the replicas are consistently changed by applying deterministic commands from a sequence, each one agreed upon using ...

متن کامل

Brief Announcement: Distributed SplayNets

SplayNets are reconfigurable networks which adjust to the communication pattern over time. We present DiSplayNets, a distributed (concurrent and decentralized) implementation of SplayNets. 1998 ACM Subject Classification C.2.1 Network Architecture and Design, Distributed networks

متن کامل

Brief Announcement: From an Intermittent Rotating Star to a Leader

The class of eventual leader oracle [2] (usually denoted Ω) provides the processes with a leader primitive that outputs a process id each time it is called, and such that, after some finite but unknown time, all its invocations return the same id, which is the identity of a correct process (a process that does not commit failures). Such an oracle is particularly weak: (1) a correct leader is ev...

متن کامل

Brief Announcement: A Fast Distributed Slicing Algorithm∗

1. THE SLICING PROBLEM Many studies have identified heterogeneous distributions of attributes (e.g., storage, bandwidth, load, uptime) in distributed systems. Applications may suffer from ignoring such heterogeneity, as already testified by benefits from super-peers/regular-peers classification. As a step further, partitioning the system into portions or slices of nodes that share similar attri...

متن کامل

Brief Announcement: Randomized Shared Queues

This paper presents a speci cation of a randomized shared queue that can lose some elements or return them out of order (not in FIFO), shows that the speci cation can be implemented over the probabilistic quorum algorithm of [4, 3], and analyzes the behavior of this implementation. Distributed algorithms that can tolerate some lost and outof-order messages are candidates for replacing the messa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: LASER THERAPY

سال: 2004

ISSN: 1884-7269,0898-5901

DOI: 10.5978/islsm.14.0_10