標題: Titlebook: Distributed Computing; 14th International C Maurice Herlihy Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Algorithms.B [打印本頁] 作者: Lensometer 時間: 2025-3-21 17:06
書目名稱Distributed Computing影響因子(影響力)
書目名稱Distributed Computing影響因子(影響力)學科排名
書目名稱Distributed Computing網(wǎng)絡(luò)公開度
書目名稱Distributed Computing網(wǎng)絡(luò)公開度學科排名
書目名稱Distributed Computing被引頻次
書目名稱Distributed Computing被引頻次學科排名
書目名稱Distributed Computing年度引用
書目名稱Distributed Computing年度引用學科排名
書目名稱Distributed Computing讀者反饋
書目名稱Distributed Computing讀者反饋學科排名
作者: ENACT 時間: 2025-3-21 23:24 作者: ANN 時間: 2025-3-22 03:50
Bounds for Mutual Exclusion with only Processor Consistency,s. Processor Consistency-Goodman’s version (PC-G) is an exception. Ahamad et al.[l] showed that Peterson’s mutual exclusion algorithm is correct for PC-G, but Lamport’s bakery algorithm is not. In this paper, we derive a lower bound on the number and type (single- or multi-writer) of variables that 作者: restrain 時間: 2025-3-22 05:15
Even Better DCAS-Based Concurrent Deques,blocking synchronization on tomorrow’s mul- tiprocessor machines. However, before such a primitive will be incorpo- rated into hardware design, its utility needs to be proven by developing a body of effective non-blocking data structures using DCAS..In a previous paper, we presented two linearizable作者: 存在主義 時間: 2025-3-22 09:32 作者: 粗魯?shù)娜?nbsp; 時間: 2025-3-22 13:13 作者: 粗魯?shù)娜?nbsp; 時間: 2025-3-22 19:38 作者: LINES 時間: 2025-3-22 22:51 作者: NEX 時間: 2025-3-23 05:12
Polynomial and Adaptive Long-lived (2,- 1)-Renaming,olynomial algorithm for long-lived (2ft - 1)- renaming. The algorithm is adaptive as its step complexity is O(k4); here k is the point contention-the maximal number of simultaneously active processes in some point of the execution. Polynomial step complexity is achieved by having processes help each作者: Maximize 時間: 2025-3-23 09:22
Computing with Infinitely Many Processes,rticipate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in models with finite bounds on the number of processes, an作者: 貨物 時間: 2025-3-23 12:55
Establishing Business Rules for Inter-Enterprise Electronic Commerce,non-repudiation. But they generally do not attempt to regulate the activities of the participants in an e-commerce transac- tion, treating them, implicitly, as autonomous agents. This is adequate for most cases of client-to-vendor commerce, but is quite unsatisfactory for inter-enterprise electronic作者: 愛好 時間: 2025-3-23 17:41
Metering Schemes with Pricing,unt of money to be paid to web sites hosting advertisements. Indeed, the amount of money paid by the publicity agencies to the web sites depends on the number of clients which visited the sites. In this paper we consider a generalization of the metering scheme proposed by Naor and Pinkas [5]. In the作者: 知識 時間: 2025-3-23 19:16 作者: WAX 時間: 2025-3-24 00:27 作者: Paleontology 時間: 2025-3-24 04:02
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs,ays sufficient, and it was conjectured that just δ. + 1 are really needed, that is, one more colour is sufficient. Nonetheless, it has just been shown [2] that for sufficiently large n there are graphs requiring Ω(n/log n) more colours than δ.. In this paper, using recent results in asymptotic graph作者: Thyroxine 時間: 2025-3-24 06:42 作者: acrimony 時間: 2025-3-24 11:27 作者: AVOID 時間: 2025-3-24 16:55 作者: inspiration 時間: 2025-3-24 22:09 作者: 機警 時間: 2025-3-25 00:36 作者: 一加就噴出 時間: 2025-3-25 07:16 作者: justify 時間: 2025-3-25 11:17
What Is the Problem? Men and Joulesblocking synchronization on tomorrow’s mul- tiprocessor machines. However, before such a primitive will be incorpo- rated into hardware design, its utility needs to be proven by developing a body of effective non-blocking data structures using DCAS..In a previous paper, we presented two linearizable作者: 切碎 時間: 2025-3-25 13:25 作者: Cloudburst 時間: 2025-3-25 17:36
Process, Content, and Community Building to be unreliable but characterized by probabilistic failure rates of processes and message deliveries. The protocol trades correctness for scale, that is, it provides very good probabilistic guarantees on correct termination in the sense of the classical specification of the election problem, and o作者: Enrage 時間: 2025-3-25 23:44 作者: gusher 時間: 2025-3-26 00:10
https://doi.org/10.1007/b138892ime. The problem for n processors is defined in terms of the tasks that need to be performed efficiently and that are known to all processors. The results of this study characterize the ability of the processors to schedule their work so that when some processors establish communication, the wasted 作者: Spangle 時間: 2025-3-26 05:03 作者: Arteriography 時間: 2025-3-26 09:36 作者: 軍火 時間: 2025-3-26 15:38
https://doi.org/10.1007/978-3-031-66719-0non-repudiation. But they generally do not attempt to regulate the activities of the participants in an e-commerce transac- tion, treating them, implicitly, as autonomous agents. This is adequate for most cases of client-to-vendor commerce, but is quite unsatisfactory for inter-enterprise electronic作者: maroon 時間: 2025-3-26 17:10
System Monitoring through a Digital Twinunt of money to be paid to web sites hosting advertisements. Indeed, the amount of money paid by the publicity agencies to the web sites depends on the number of clients which visited the sites. In this paper we consider a generalization of the metering scheme proposed by Naor and Pinkas [5]. In the作者: Iniquitous 時間: 2025-3-27 00:03
Visualisation in a Digital Twin Contextproperty guarantees that the system will always return to and stay within a specified set of legal states within bounded time re- gardless of its initial state. A self-stabilizing application therefore has the potential of recovering from the effects of arbitrary transient fai- lures. However, to ac作者: ARIA 時間: 2025-3-27 02:33
The Engineering of Digital Twinsuling constraints (stronger daemon), while preserving the stabilization property, is useful and challenging. Designing transforma- tion techniques for these refinements has been the subject of serious in- vestigations in recent years. This paper proposes a transformation tech- nique to achieve the a作者: 開始從未 時間: 2025-3-27 05:36
Tomas Kulik,Zahra Kazemi,Peter Gorm Larsenays sufficient, and it was conjectured that just δ. + 1 are really needed, that is, one more colour is sufficient. Nonetheless, it has just been shown [2] that for sufficiently large n there are graphs requiring Ω(n/log n) more colours than δ.. In this paper, using recent results in asymptotic graph作者: 退潮 時間: 2025-3-27 12:25
The Engineering of Mixed Reality Systemsractive because it is generic, scalable, adapts well to failures and recoveries, and has a reliability that gracefully degrades with the number of failures in a run. However, rumor mongering uses random selection for communications. We study the impact of using random selection in this paper. We pre作者: Allege 時間: 2025-3-27 16:34
Emmanuel Dubois,Phil Gray,Laurence Nigay “conflict” relation on the set of messages, generic broad- cast ensures that any two messages that conflict are delivered in the same order; messages that do not conflict may be delivered in different order. In this paper, we define what it means for an implementation generic broadcast to be “thrif作者: Feckless 時間: 2025-3-27 21:39
An Integrating Framework for Mixed Systemss location from the network nodes. Each node contains a database that “knows” what kind of documents or information are stored in other nodes (e.g. a node could be a Web server that answers queries about documents stored on the Web). The databases in each node, when queried, provide a pointer that l作者: Lipohypertrophy 時間: 2025-3-27 22:12
Maurice HerlihyIncludes supplementary material: 作者: relieve 時間: 2025-3-28 04:41 作者: AXIOM 時間: 2025-3-28 09:22
https://doi.org/10.1007/b138892We show that Naming- the existence of distinct IDs known to all- is a necessary assumption of Herlihy’s universality result for Con- sensus. We then show in a very precise sense that Naming is harder than Consensus and bring to the surface some important differences existing between popular shared memory models which usually remain unnoticed.作者: subacute 時間: 2025-3-28 12:08 作者: 高度表 時間: 2025-3-28 17:36
https://doi.org/10.1007/3-540-40026-5Algorithms; Broadcast; CORBA; Internet; Roadcasting; algorithm; distributed computing; algorithm analysis a作者: 不能仁慈 時間: 2025-3-28 18:49 作者: 保守 時間: 2025-3-28 23:32 作者: 倔強一點 時間: 2025-3-29 05:51
https://doi.org/10.1007/978-3-319-07920-2our algorithm, each process p performs O(min(k,log N)) remote memory references to enter and exit its critical section, where k is the maximum “point contention” experienced by p. The space complexity of our algorithm is <9(iV), which is clearly optimal.作者: 泥沼 時間: 2025-3-29 09:07 作者: Traumatic-Grief 時間: 2025-3-29 11:24
Conference proceedings 2000 2000 was held on4-6 October, 2000 in Toledo, Spain. This volume includes 23 contributed papers and the extended abstract of an invited lecture from last year’s DISC. It is expected that the regular papers will later be submitted in a more polished form to fully refereed scienti?c journals. The exte作者: 輕彈 時間: 2025-3-29 19:38 作者: ADJ 時間: 2025-3-29 19:55
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs, enumeration, we show not only that (somehow surprisingly) the same bound holds for regular graphs, but also that it can be improved to Ω(n log log n/ log n). We also show that Ω (d.√log log d.) colours are necessary, where d. is the degree of G.作者: 無目標 時間: 2025-3-30 01:04 作者: 翅膀拍動 時間: 2025-3-30 05:39 作者: 思考才皺眉 時間: 2025-3-30 08:18
https://doi.org/10.1007/978-3-031-30705-8understand how efficiently a distributed system can compute those things which are computable. There are a variety of resource to consider, including time, contention, and the number and sizes of messages and shared objects.作者: crutch 時間: 2025-3-30 12:33 作者: STYX 時間: 2025-3-30 19:58
Ariane Hoy,Mathew Johnson,Robert Hackettuction, analyze their time and communication requirements, and propose an algorithm achieving optimal time and communication, i.e., meeting the above lower bounds. Finally we discuss extensions to the case of dynamically joining participants.作者: 剛毅 時間: 2025-3-30 22:16 作者: 生命 時間: 2025-3-31 02:27
System Monitoring through a Digital Twint receives a full payment. Finally, if it receives a number of visits comprised between ￡ + 1 and h - 1 then it receives a partial payment which depends on /. We provide lower bounds on the size of the information distributed to clients and to servers by metering schemes and present a scheme which achieves these lower bounds.作者: exigent 時間: 2025-3-31 08:27 作者: 上坡 時間: 2025-3-31 11:35
Establishing Business Rules for Inter-Enterprise Electronic Commerce, independently developed, and may be quite heterogeneous. Yet, they have to intemperate, and be brought to bear in regulating each e-commerce transaction. This paper presents a mechanism that allows such interoperation between policies, and thus provides for inter-enterprise electronic commerce.作者: 砍伐 時間: 2025-3-31 13:30 作者: Fortify 時間: 2025-3-31 18:33 作者: Institution 時間: 2025-3-31 22:44 作者: 血統(tǒng) 時間: 2025-4-1 03:40
Visualisation in a Digital Twin Contextrty of distributed algorithms exhibits interest- ing analogies to stabilizing feedback systems used in various engineering domains. In this paper we would like to show that techniques from con- trol theory, namely Ljapunov’s “Second Method,” can be used to more easily verify the self-stabilization property of distributed algorithms.作者: Camouflage 時間: 2025-4-1 09:15
The Engineering of Mixed Reality Systemsrumor mongering. The one remaining attraction that rumor mongering has over the determinisitic protocol-namely graceful degradation-comes at a high cost in terms of the number of messages sent. We compare the two approaches both at an abstract level and in terms of how they perform in an Ethernet and small wide area network of Ethernets.
