作者: 和藹 時間: 2025-3-21 21:20
978-3-540-58449-0Springer-Verlag Berlin Heidelberg 1994作者: 開始發(fā)作 時間: 2025-3-22 00:31 作者: 鋼筆記下懲罰 時間: 2025-3-22 06:00 作者: Condescending 時間: 2025-3-22 11:28 作者: Fraudulent 時間: 2025-3-22 15:40 作者: Fraudulent 時間: 2025-3-22 18:39 作者: Cholagogue 時間: 2025-3-23 00:22
Secure distributed computing: Theory and practice,The general area of secure distributed computing and the interplay between distributed computing and security/ cryptography research is reviewed. Recent theoretical and practical developments are discussed.作者: finite 時間: 2025-3-23 02:13
Coping with contention,Contention in multiprocessor systems is considered. A randomized algorithm for mutual exclusion is presented that achieves a constant average response time under varying degrees of contention. The use of randomization does not affect the safety or progress conditions, only the performance of the algorithm.作者: 圓桶 時間: 2025-3-23 06:46
The Economics of Higher Educationon. In this paper, we examine the possibility of using such systems as repositories for replicated files to facilitate lowlatency data sharing. Asynchrony in communication and computation, complex combinations of site and communication failures, and in particular, network partitions that characteriz作者: COM 時間: 2025-3-23 13:40
https://doi.org/10.1007/978-0-306-48368-4uced instruction set and provides in hardware mechanisms for the emulation of shared memory: random hashing to avoid hot spots, multiple contexts with regular scheduling to hide network latency and fast context switch to minimize overhead. Furthermore it provides hardware support for parallel operat作者: 繁重 時間: 2025-3-23 17:21
Farmers, Fossils, and Heat, July 18–22nchronous Communication was first introduced by the Isis system as a powerful mechanism for building fault-tolerant processes that mask failures by replication: it can be understood as a rule for ordering message deliveries (reliable multicasts) with respect to view changes, defined by a membership 作者: 白楊魚 時間: 2025-3-23 20:32
The Diaspora: Origin and Meaningoperation that atomically increments the register and returns the previous value. We implement this register in a synchronous, message-passing model with crash failures. In our implementation, an increment operation halts in .(log .) rounds of communication, where . is the number of concurrently exe作者: exacerbate 時間: 2025-3-23 23:14 作者: Irrigate 時間: 2025-3-24 03:53 作者: Indigence 時間: 2025-3-24 08:19
Tatiana V. Nikulina,J. Patrick Kociolekucture partitioned into . segments such that each process owns one segment. Each process can . its own segment, and instantaneously . all segments. In our implementation, each object operation requires . operations on atomic multi-writer multi-reader registers.作者: 做方舟 時間: 2025-3-24 13:56
Tatiana V. Nikulina,J. Patrick Kociolekred to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is dependent on the size of the original name space, and allow processes to acquire names only once. In this paper, we present several new renaming algorithms作者: Anthology 時間: 2025-3-24 16:45
Roberta Congestri,Patrizia Albertanove that there are objects that are classified high in the hierarchy, yet, they can not implement objects that are classified much lower in the hierarchy. Our main result is: for any two levels ..≥.. in the hierarchy, there are shared objects .. and .. that belong to .. and .., respectively, such tha作者: THROB 時間: 2025-3-24 19:01
https://doi.org/10.1007/978-1-4613-8443-4 .., of a multiset .., x., ..., .., whose elements are drawn from a totally ordered universe . and stored at the . entities of a ring network..This problem is unsolvable if the ring size is not known to the entities, and has complexity ..) in the case of asynchronous rings of known size..We show tha作者: crockery 時間: 2025-3-25 01:36
https://doi.org/10.1007/978-1-4613-8443-4 a connection establishment protocol to allow a reliable exchange of data. A . is employed to establish the connection. This paper identifies the precise level of handshake needed under different assumptions on the nodes and on the network, using a formal model of connection management. In particula作者: inculpate 時間: 2025-3-25 06:24 作者: 制度 時間: 2025-3-25 09:16 作者: collagen 時間: 2025-3-25 13:37
https://doi.org/10.1007/978-1-4613-8443-4nchronizers: .., η. and .. These synchronizers use sparse covers in order to operate and have the following advantages over synchronizer .: (1) they are conceptually simpler, as only one convergecast and one broadcast processes are performed along each cluster spanning-tree between each two consecut作者: 切掉 時間: 2025-3-25 16:45
https://doi.org/10.1007/978-1-4613-8443-4ication complexity of . + c) messages for edge insertion and . + c) messages for edge removal, and worst case time complexity of . for both operations, where . is the maximum number of biconnected components in any of the connected components during the operation, . is the number of nodes in the bic作者: 閃光東本 時間: 2025-3-25 23:03
https://doi.org/10.1007/978-1-4613-8443-4lt mobility and the faults‘ power of disruption as a function of the fundamental parameter in such systems: the faults‘ .. We do so by evaluating in a mobile-fault environment a classical testbed problem for fault-tolerant computing: Byzantine agreement..We present a family of mobile-fault models MF作者: 音樂戲劇 時間: 2025-3-26 03:45
Distributed Algorithms978-3-540-48799-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Tractable 時間: 2025-3-26 05:56 作者: harmony 時間: 2025-3-26 12:09 作者: Debark 時間: 2025-3-26 16:03 作者: 哺乳動物 時間: 2025-3-26 19:43
Linear-time snapshot using multi-writer multi-reader registers,ucture partitioned into . segments such that each process owns one segment. Each process can . its own segment, and instantaneously . all segments. In our implementation, each object operation requires . operations on atomic multi-writer multi-reader registers.作者: MONY 時間: 2025-3-26 23:18
Replicated file management in large-scale distributed systems,on. In this paper, we examine the possibility of using such systems as repositories for replicated files to facilitate lowlatency data sharing. Asynchrony in communication and computation, complex combinations of site and communication failures, and in particular, network partitions that characteriz作者: 揮舞 時間: 2025-3-27 05:05 作者: Flounder 時間: 2025-3-27 08:45 作者: Palliation 時間: 2025-3-27 09:46 作者: slow-wave-sleep 時間: 2025-3-27 17:34
Exotic behaviour of consensus numbers,. distinct processes, which communicate only by accessing objects in ...An interesting question concerning consensus numbers is the following: is it possible to combine two objects, each of which having a small consensus number, and to obtain a system which has a large consensus number? We answer th作者: 笨重 時間: 2025-3-27 20:37 作者: happiness 時間: 2025-3-27 22:06
Linear-time snapshot using multi-writer multi-reader registers,ucture partitioned into . segments such that each process owns one segment. Each process can . its own segment, and instantaneously . all segments. In our implementation, each object operation requires . operations on atomic multi-writer multi-reader registers.作者: 在前面 時間: 2025-3-28 04:34
Fast, long-lived renaming,red to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is dependent on the size of the original name space, and allow processes to acquire names only once. In this paper, we present several new renaming algorithms作者: 錯事 時間: 2025-3-28 08:40 作者: 坦白 時間: 2025-3-28 12:38 作者: 燒瓶 時間: 2025-3-28 16:47
The level of handshake required for establishing a connection, a connection establishment protocol to allow a reliable exchange of data. A . is employed to establish the connection. This paper identifies the precise level of handshake needed under different assumptions on the nodes and on the network, using a formal model of connection management. In particula作者: 易于 時間: 2025-3-28 21:23
Local labeling and resource allocation using preprocessing, preprocessing can be performed on ., and afterwards a sequence of labeling problems have to be solved on different subgraphs of .. We suggest a preprocessing that produces an orientation of G. The goal is to exploit this preprocessing to minimize the radius of the neighborhood around each vertex fr作者: BOLUS 時間: 2025-3-28 23:35
A scalable approach to routing in ATM networks,etic model that captures the characteristics of the new routing problem. In this model we define the general routing problem, and a more restricted case which helps in the solution of the general case. For the latter case we present a routing scheme for a given tree network, by decomposing the netwo作者: Exploit 時間: 2025-3-29 04:10 作者: LUCY 時間: 2025-3-29 10:50
An incremental distributed algorithm for computing biconnected components,ication complexity of . + c) messages for edge insertion and . + c) messages for edge removal, and worst case time complexity of . for both operations, where . is the maximum number of biconnected components in any of the connected components during the operation, . is the number of nodes in the bic作者: micronutrients 時間: 2025-3-29 14:28
Reaching (and maintaining) agreement in the presence of mobile faults,lt mobility and the faults‘ power of disruption as a function of the fundamental parameter in such systems: the faults‘ .. We do so by evaluating in a mobile-fault environment a classical testbed problem for fault-tolerant computing: Byzantine agreement..We present a family of mobile-fault models MF作者: 虛度 時間: 2025-3-29 16:01 作者: 清真寺 時間: 2025-3-29 20:51 作者: 劇本 時間: 2025-3-30 00:30 作者: Trabeculoplasty 時間: 2025-3-30 05:58
Replicated file management in large-scale distributed systems,oning about large-scale distributed systems, it is also an effective programming model. We support these claims by developing algorithms for managing replicated files with one-copy serializability as the correctness criteria.作者: 擋泥板 時間: 2025-3-30 11:01 作者: 刺耳 時間: 2025-3-30 12:46
Fast, long-lived renaming,. Most of our algorithms have time complexity that is independent of the size of the original name space, and some of our algorithms solve a new, more general version of the renaming problem called long-lived renaming. In long-lived renaming algorithms, processes may repeatedly acquire and release names.作者: Heart-Attack 時間: 2025-3-30 19:18 作者: 連系 時間: 2025-3-30 21:00
Finding the extrema of a distributed multiset,t, in synchronous rings of known size, this problem can always be solved in .+ log .) · n) bits and ..) time for any integer c> 0, where .=Max{|x.|, |x.|}. The previous solutions required ..) bits and the same amount of time..Based on these results, we also present a bit optimal solution to the problem of finding the multiplicity of the extrema.作者: Patrimony 時間: 2025-3-31 02:20
0302-9743 ion, real-time systems, dynamic algorithms, self-stabilizing algorithms, synchronization, graph algorithms, wait-free algorithms, mechanisms for security, replicating data, and distributed databases.978-3-540-58449-0978-3-540-48799-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Hla461 時間: 2025-3-31 08:05 作者: 我不怕犧牲 時間: 2025-3-31 11:07 作者: 嚴(yán)重傷害 時間: 2025-3-31 16:39 作者: meretricious 時間: 2025-3-31 17:34
Roberta Congestri,Patrizia Albertanot .. can not implement ... (We allow the specifications of the shared objects to be non deterministic.) This result implies not only that the current definition of the wait-free hierarchy does not express the computational power of shared objects, but also that there is no other hierarchy that does.作者: 有助于 時間: 2025-4-1 00:11 作者: abduction 時間: 2025-4-1 04:53
Farmers, Fossils, and Heat, July 18–22sus is solvable whenever the PP-VSC problem is solvable, however (2) there are environments where consensus is solvable, but not PP-VSC. The paper also defines an environment in which PP-VSC can be solved. The practical consequences of the result are discussed.作者: Mangle 時間: 2025-4-1 06:06
The Diaspora: Origin and Meaning what it says about lower bounds. Our result says that Ω(log .) is the best possible lower bound that applies to so many objects in so many models. The algorithm itself is interesting, however, because it is based on an optimal solution for ., a simple decision problem used by Herlihy and Tuttle to prove their lower bound.作者: 扔掉掐死你 時間: 2025-4-1 12:39 作者: Inoperable 時間: 2025-4-1 15:05
https://doi.org/10.1007/978-1-4613-8443-4lexity. (4) since there is no need to elect preferred links between neighboring clusters, the initialization process of these synchronizers is more efficient: it requires only .|log |.} + |E|) messages.作者: 天然熱噴泉 時間: 2025-4-1 21:06 作者: isotope 時間: 2025-4-1 23:41
