作者: 你敢命令 時(shí)間: 2025-3-21 20:58
Seamlessly selecting the best copy from internet-wide replicated web servers,web sites arc served from single locations. This necessitates frequent long distance network transfers of data (potentially repeatedly) which results in a high response time for users, and is wasteful of the available network bandwidth. Moreover, it commonly creates a single point of failure between作者: stress-response 時(shí)間: 2025-3-22 03:27
Wait-free synchronization in quantum-based multiprogrammed systems,heduled for execution using a scheduling quantum. We show that, in such systems, any object with consensus number . in Herlihy‘s wait-free hierarchy is universal for any number of processes executing on . processors, provided the scheduling quantum is of a certain size. We give an asymptotically tig作者: MAIZE 時(shí)間: 2025-3-22 05:20 作者: bisphosphonate 時(shí)間: 2025-3-22 10:30 作者: Alveoli 時(shí)間: 2025-3-22 13:29
Directed virtual path layouts in ATM networks,ns of a link are not identical. On top of a given physical network we construct directed VPs. Routing in the physical network is done using these VPs. Given the capacity of each physical link (the maximum number of VPs that can pass through the link) the problem consists in defining a set of VPs to 作者: Alveoli 時(shí)間: 2025-3-22 20:03
A decision-theoretic approach to reliable message delivery,ring a simple problem involving reliable communication, showing how considerations of utility and probability can be used to decide when it is worth sending heartbeat messages and, if they are sent, how often they should be sent.作者: Gum-Disease 時(shí)間: 2025-3-22 21:55 作者: indicate 時(shí)間: 2025-3-23 02:11 作者: vertebrate 時(shí)間: 2025-3-23 09:05 作者: FOIL 時(shí)間: 2025-3-23 12:35 作者: 宴會(huì) 時(shí)間: 2025-3-23 15:00
The compactness of interval routing for almost all graphs,at use the same outgoing edge in the routing table. Such groups of addresses are represented by some intervals of consecutive integers. We show that almost all the graphs, i.e., a fraction of at least 1? 1/.. of all the .-node graphs, support a shortest path interval routing with at most . intervals作者: 機(jī)密 時(shí)間: 2025-3-23 20:04
A wait-free classification of loop agreement tasks,on of loop agreement tasks. Each loop agreement task can be assigned an . consisting of a finitely-presented group . and a distinguished element . in .. This signature completely characterizes the task‘s computational power. If . and . are loop agreement tasks with respective signatures 〈.〉 and 〈.〉,作者: 織布機(jī) 時(shí)間: 2025-3-24 00:46 作者: photopsia 時(shí)間: 2025-3-24 06:04 作者: 翻布尋找 時(shí)間: 2025-3-24 07:28 作者: 新娘 時(shí)間: 2025-3-24 11:10
Failure detection and consensus in the crash-recovery model,. We first propose new failure detectors that are particularly suitable to the crash-recovery model. We next determine under what conditions stable storage is necessary to solve consensus in this model. Using the new failure detectors, we give two consensus algorithms that match these conditions: on作者: Adj異類的 時(shí)間: 2025-3-24 15:06
Building the Flak Cannon Game Loopns could span arbitrarily large durations. We are particularly interested in the domain of electronic commerce applications in the Internet/Web environment. The Internet frequently suffers from failures which can affect both the performance and consistency of applications run over it. A number of fa作者: alliance 時(shí)間: 2025-3-24 21:19 作者: Anticlimax 時(shí)間: 2025-3-25 00:50
Introducing Flex and Flex Builder 2,heduled for execution using a scheduling quantum. We show that, in such systems, any object with consensus number . in Herlihy‘s wait-free hierarchy is universal for any number of processes executing on . processors, provided the scheduling quantum is of a certain size. We give an asymptotically tig作者: 階層 時(shí)間: 2025-3-25 03:38
Introducing Flex and Flex Builder 2,cal interface to the shared memory, and in particular, there are no . registers. This paper assumes that processes do not fail, and the shared memory consists only of read/write registers, which are initialized to some default value. A complete characterization of the functions and relations that ca作者: Indecisive 時(shí)間: 2025-3-25 08:05 作者: Hla461 時(shí)間: 2025-3-25 13:34
https://doi.org/10.1007/978-1-4302-0566-1ns of a link are not identical. On top of a given physical network we construct directed VPs. Routing in the physical network is done using these VPs. Given the capacity of each physical link (the maximum number of VPs that can pass through the link) the problem consists in defining a set of VPs to 作者: 束縛 時(shí)間: 2025-3-25 17:38 作者: 確定方向 時(shí)間: 2025-3-25 23:27
https://doi.org/10.1007/978-1-4842-8722-4 main result is a new Leader Election algorithm, with . time complexity and .(. · lg(.)) message transmission complexity. Our distributed solution uses a special form of the propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special . approach for the e作者: 捏造 時(shí)間: 2025-3-26 02:18 作者: HAIRY 時(shí)間: 2025-3-26 08:03
The Memory (aka Concentration) Game,versary. It is well-known that Byzantine agreement is possible if and only if the number of cheaters is less than ./3. In this paper we consider a general adversary that is specified by a set of subsets of the player set (the adversary structure), and any one of these subsets may be corrupted by the作者: nostrum 時(shí)間: 2025-3-26 10:25
The Memory (aka Concentration) Game,esses axe simultaneously either holding or trying to acquire a name. A solution to this problem supplies a renaming object supporting both . and . operations so that no two processes ever simultaneously hold the same name. The protocol is . if each participant successfully completes either operation作者: TOM 時(shí)間: 2025-3-26 13:23 作者: HEW 時(shí)間: 2025-3-26 20:08 作者: arthrodesis 時(shí)間: 2025-3-26 22:08 作者: GUILE 時(shí)間: 2025-3-27 02:09 作者: 干涉 時(shí)間: 2025-3-27 07:40 作者: 灰心喪氣 時(shí)間: 2025-3-27 10:09
https://doi.org/10.1007/978-3-031-36484-6. We first propose new failure detectors that are particularly suitable to the crash-recovery model. We next determine under what conditions stable storage is necessary to solve consensus in this model. Using the new failure detectors, we give two consensus algorithms that match these conditions: on作者: 核心 時(shí)間: 2025-3-27 13:57 作者: 確認(rèn) 時(shí)間: 2025-3-27 20:40 作者: connoisseur 時(shí)間: 2025-3-28 00:50
https://doi.org/10.1007/BFb0056467ATM; Distributed Algorithms; Distributed Computing; Distributed Systems; Internet; Internet Computing; Jav作者: AGGER 時(shí)間: 2025-3-28 05:45 作者: LANCE 時(shí)間: 2025-3-28 07:58
Distributed Computing978-3-540-49693-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 混亂生活 時(shí)間: 2025-3-28 13:01
Adobe Integrated Runtime (AIR),ring a simple problem involving reliable communication, showing how considerations of utility and probability can be used to decide when it is worth sending heartbeat messages and, if they are sent, how often they should be sent.作者: 策略 時(shí)間: 2025-3-28 18:25
https://doi.org/10.1007/978-1-4842-8722-4evised the ., a scalable and local mechanism for ensuring mutually exclusive access to mobile objects. This directory has communication complexity optimal within a factor of (1+.)/2, where . is the “minimum spanning tree stretch” of the underlying network.作者: Polydipsia 時(shí)間: 2025-3-28 20:42
A decision-theoretic approach to reliable message delivery,ring a simple problem involving reliable communication, showing how considerations of utility and probability can be used to decide when it is worth sending heartbeat messages and, if they are sent, how often they should be sent.作者: 觀察 時(shí)間: 2025-3-29 00:12 作者: Allodynia 時(shí)間: 2025-3-29 05:18
Building the Flak Cannon Game Loops will result in a better response-time and a higher availability of these sites. Equally important, this architecture will potentially cut down a significant fraction of the traffic on the Internet, freeing bandwidth for other uses.作者: 不成比例 時(shí)間: 2025-3-29 09:33
The Memory (aka Concentration) Game,in the number of players. The purpose of this paper is to present the first protocol with polynomial message and computation complexity for any (even exponentially large) specification of the adversary structure. This closes a gap in a recent result of Cramer, Damg?rd and Maurer on applying span programs to secure multi-party computation.作者: 殘酷的地方 時(shí)間: 2025-3-29 13:11 作者: Ablation 時(shí)間: 2025-3-29 17:07
Efficient Byzantine agreement secure against general adversaries,in the number of players. The purpose of this paper is to present the first protocol with polynomial message and computation complexity for any (even exponentially large) specification of the adversary structure. This closes a gap in a recent result of Cramer, Damg?rd and Maurer on applying span programs to secure multi-party computation.作者: 信徒 時(shí)間: 2025-3-29 21:46
Propagation and leader election in a multihop broadcast environment,lection procedure phase. The latter is required for achieving the linear time..It is demonstrated that the broadcast model requires solutions which are different from the classic point to point model.作者: 火光在搖曳 時(shí)間: 2025-3-30 01:24 作者: 思鄉(xiāng)病 時(shí)間: 2025-3-30 05:37 作者: 考古學(xué) 時(shí)間: 2025-3-30 12:05 作者: 固定某物 時(shí)間: 2025-3-30 14:36 作者: Pantry 時(shí)間: 2025-3-30 18:43
https://doi.org/10.1007/978-1-4302-0336-0ilure detector has to maintain in order to detect a transient fault. The history locality is related to the number of consecutive system configurations that a failure detector has to maintain in order to detect a transient fault.作者: 分貝 時(shí)間: 2025-3-30 22:56
https://doi.org/10.1007/978-1-4302-0566-1es of simple networks, namely the path, the cycle, the grid, the tori, the complete k-ary tree, and the general tree, we present optimal or near optimal lower and upper bounds on the virtual diameter as a function of the capacity.作者: 新手 時(shí)間: 2025-3-31 03:27 作者: Calculus 時(shí)間: 2025-3-31 07:36 作者: AUGER 時(shí)間: 2025-3-31 12:22
Computing in totally anonymous asynchronous shared memory systems,puted with two registers, the consensus protocol uses a linear number of shared registers and rounds..The paper proves logarithmic lower bounds on the number of registers and rounds needed for solving consensus in this model, indicating the difficulty of computing relations in this model.作者: 使顯得不重要 時(shí)間: 2025-3-31 16:27 作者: avenge 時(shí)間: 2025-3-31 21:12 作者: 忍耐 時(shí)間: 2025-3-31 22:04
A stabilizing repair timer,self subject to faults. The main results are requirement specifications for a distributed repair timer and a repair timer algorithm. The algorithm self-stabilizes in . rounds, where . is the diameter of the network, and provides reliable timing from .-faulty configurations within . rounds.作者: 占線 時(shí)間: 2025-4-1 04:27 作者: 喪失 時(shí)間: 2025-4-1 06:18
0302-9743 , DISC‘98, held in Andros, Greece, in September 1998..The 28 revised papers presented were carefully reviewed and selected from a total of 87 submissions. Also included are one invited paper and two abstracts of invited contributions. The papers address all currect issues of distributed systems, in 作者: 止痛藥 時(shí)間: 2025-4-1 12:57
