23rd International Conference on Distributed Computing Systems, 2003. Proceedings.最新文献

筛选
英文 中文
Monitoring and characterization of component-based systems with global causality capture 具有全局因果关系捕获的基于组件的系统的监测和表征
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203492
Jun Li
{"title":"Monitoring and characterization of component-based systems with global causality capture","authors":"Jun Li","doi":"10.1109/ICDCS.2003.1203492","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203492","url":null,"abstract":"Current software development techniques and tools lack the capability to characterize function call chains in multithreaded and distributed applications built upon component technologies like CORBA, COM and J2EE. The root cause is that causal linkage information necessary to trace end-to-end call chains is private to each vendor's runtime and often unavailable for logging or analysis. We propose and demonstrate a mechanism for maintaining and correlating global causality information of component-based applications, and using this information to expose and characterize function call chains and their associated behaviors in such multithreaded and distributed applications. Our approach relies on a global virtual tunnel facilitated by the instrumented stubs and skeletons. This tunnel maintains and correlates causal information throughout the end-to-end call chains spanning threads, processes and processors. As a result, monitoring data captured locally can be correlated and system-wide propagation of timing latency and CPU utilization becomes perceivable.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"516 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123095032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Human design: wearable computers for human networking 人性化设计:用于人际网络的可穿戴电脑
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203474
A. Pentland
{"title":"Human design: wearable computers for human networking","authors":"A. Pentland","doi":"10.1109/ICDCS.2003.1203474","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203474","url":null,"abstract":"Computer technology has mostly focused either on the isolated individual, or has treated the person as a clueless extra wandering in a computer-controlled environment. Researchers seem to have forgotten that people are social animals, and that the quality of their lives is defined by their roles in human organizations. Instead of inventing technology for the individual as an isolated entity, why not invent systems that support people's organizational roles? Or even invent new types of organizations? My colleagues and I are inventing technology that can potentially produce organizations that are more creative and efficient, and that better support the individual. Using wearable computers that actively analyze face-to-face interactions within the workplace we can extract conversational features, identify participants, define context, and determine content. By aggregating this information, high-potential collaborations and expertise within the organization can be identified, information movement and decisionmaking can be augmented, and social networks reinforced. Examples using this technology to initiate productive connections are shown, and privacy concerns are addressed.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114670196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Collision avoidance in single-channel ad hoc networks using directional antennas 使用定向天线的单通道自组织网络的避碰
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203515
Yu Wang, J. Garcia-Luna-Aceves
{"title":"Collision avoidance in single-channel ad hoc networks using directional antennas","authors":"Yu Wang, J. Garcia-Luna-Aceves","doi":"10.1109/ICDCS.2003.1203515","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203515","url":null,"abstract":"Three collision-avoidance protocols are analyzed that use omni-directional packet reception together with omni-directional transmissions, directional transmissions, or a combination of both. A simple model is introduced to analyze the performance of these collision avoidance protocols in multi-hop networks with arbitrary topologies. The numerical results of this analysis show that collision avoidance using a narrow antenna beamwidth for the transmission of all control and data packets achieves the highest throughput among the three collision avoidance schemes considered. Simulation experiments of the popular IEEE 802.11 MAC protocol and its variants based on directional transmissions and omni-directional packet reception validate the results predicted in the analysis. The results further show that narrow-beamwidth transmissions can also reduce the average delay experienced by nodes. It is concluded that the advantage of spatial reuse achieved by narrow-beamwidth transmissions outweighs that of conservative collision avoidance schemes featured by the omnidirectional transmission of some control packets. This is due to the fact that the latter requires far more stringent coordination of nodes with their neighbors and hidden terminals, which can lead to much more channel resource wasted due to nodes' excessive waiting time.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"474 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124259124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 37
Improving application throughput with enterprise JavaBeans Caching 使用企业JavaBeans缓存提高应用程序吞吐量
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203471
A. Leff, J. Rayfield
{"title":"Improving application throughput with enterprise JavaBeans Caching","authors":"A. Leff, J. Rayfield","doi":"10.1109/ICDCS.2003.1203471","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203471","url":null,"abstract":"We present the design of an Enterprise JavaBeans (EJBs) caching architecture, and show that EJB caching can greatly improve application throughput. Throughput is improved because data serving is offloaded from the database server to the cache-enabled application server. An important feature of our architecture is that the caching function is transparent to applications that use it. The cache-enabled application server uses the same (EJB) programming model, and the same transactional semantics, as provided by non-caching architectures.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121118525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Rate-monotonic scheduling on uniform multiprocessors 均匀多处理机上的速率单调调度
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203485
Sanjoy Baruah, J. Goossens
{"title":"Rate-monotonic scheduling on uniform multiprocessors","authors":"Sanjoy Baruah, J. Goossens","doi":"10.1109/ICDCS.2003.1203485","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203485","url":null,"abstract":"Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes (s /spl times/ t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor platforms using the rate-monotonic scheduling algorithm is considered here. A simple, sufficient test is presented for determining whether a given periodic task system will be successfully scheduled by algorithm upon a particular uniform multiprocessor platform-this test generalizes earlier results concerning rate-monotonic scheduling upon identical multiprocessor platforms.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121149917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 108
A generic framework for indulgent consensus 宽容共识的通用框架
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203455
R. Guerraoui, M. Raynal
{"title":"A generic framework for indulgent consensus","authors":"R. Guerraoui, M. Raynal","doi":"10.1109/ICDCS.2003.1203455","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203455","url":null,"abstract":"Consensus is a fundamental distributed agreement problem that has to be solved when one has to design or implement reliable applications. As consensus cannot be solved in pure asynchronous distributed systems, those systems have to be equipped with appropriate oracles to circumvent the impossibility. Several oracles (unreliable failure detector leader capability, random number generator) have been proposed, and consensus protocols based on such ad hoc oracles have been designed This paper presents a generic consensus framework that can be instantiated with any oracle, or combination of oracles, that satisfies a set of properties. This generic framework provides indulgent consensus protocols that are particularly simple and efficient both in well-behaved runs (i.e., when there are no failures), and in stable runs (i.e., when there is no failure during the execution although some processes can be initially crashed). In those runs, the protocols terminate in two communication steps (which is optimal). Indulgence means that the resulting protocol never violates its safety property even when the underlying oracle behaves arbitrarily. Interestingly, the protocol can also allow processes to decide in one communication step in some specific configurations.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123431336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Enabling snap-stabilization 使snap-stabilization
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203447
Alain Cournier, A. Datta, F. Petit, V. Villain
{"title":"Enabling snap-stabilization","authors":"Alain Cournier, A. Datta, F. Petit, V. Villain","doi":"10.1109/ICDCS.2003.1203447","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203447","url":null,"abstract":"A snap-stabilizing protocol guarantees that the system always behaves according to its specification provided some processor initiated the protocol. We present how to snap-stabilize some important protocols, like Leader Election, Reset, Snapshot, and Termination Detection. We use a Snap-stabilizing Propagation of Information with Feedback protocol for arbitrary networks as the key module in the above transformation process. Finally, we design a universal transformer to provide a snap-stabilizing version of any protocol (which can be self-stabilized with the transformer of [15]).","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115355718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 44
Obstruction-free synchronization: double-ended queues as an example 无阻塞同步:以双端队列为例
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203503
M. Herlihy, Victor Luchangco, Mark Moir
{"title":"Obstruction-free synchronization: double-ended queues as an example","authors":"M. Herlihy, Victor Luchangco, Mark Moir","doi":"10.1109/ICDCS.2003.1203503","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203503","url":null,"abstract":"We introduce obstruction-freedom, a new nonblocking property for shared data structure implementations. This property is strong enough to avoid the problems associated with locks, but it is weaker than previous nonblocking properties-specifically lock-freedom and wait-freedom-allowing greater flexibility in the design of efficient implementations. Obstruction-freedom admits substantially simpler implementations, and we believe that in practice it provides the benefits of wait-free and lock-free implementations. To illustrate the benefits of obstruction-freedom, we present two obstruction-free CAS-based implementations of double-ended queues (deques); the first is implemented on a linear array, the second on a circular array. To our knowledge, all previous nonblocking deque implementations are based on unrealistic assumptions about hardware support for synchronization, have restricted functionality, or have operations that interfere with operations at the opposite end of the deque even when the deque has many elements in it. Our obstruction-free implementations have none of these drawbacks, and thus suggest that it is much easier to design obstruction-free implementations than lock-free and wait-free ones. We also briefly discuss other obstruction-free data structures and operations that we have implemented.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"14 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114134527","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 540
Smart dust-hardware limits to wireless sensor networks 智能灰尘硬件限制无线传感器网络
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203445
K. Pister
{"title":"Smart dust-hardware limits to wireless sensor networks","authors":"K. Pister","doi":"10.1109/ICDCS.2003.1203445","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203445","url":null,"abstract":"With the MEMS revolution in full swing, microsensors are now following manufacturing curves that are at least related to Moore's Law. Combined with the push for low power communication and computation coming from the handheld community, this enables an exciting new field of low-cost, high-performance wireless sensor networks. This talk will address some of the practical and physical limits associated with miniaturization of wireless sensor networks.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129870137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Decision-support workload characteristics on a clustered database server from the OS perspective 从操作系统角度看集群数据库服务器上的决策支持工作负载特征
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203488
Yanyong Zhang, Jianyong Zhang, A. Sivasubramaniam, Chun Liu, H. Franke
{"title":"Decision-support workload characteristics on a clustered database server from the OS perspective","authors":"Yanyong Zhang, Jianyong Zhang, A. Sivasubramaniam, Chun Liu, H. Franke","doi":"10.1109/ICDCS.2003.1203488","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203488","url":null,"abstract":"A range of database services are being offered on clusters of workstations today to meet the demanding needs of applications with voluminous datasets, high computational and I/O requirements and a large number of users. The underlying database engine runs on cost-effective off-the-shelf hardware and software components that may not really be tailored/tuned for these applications. At the same time, many of these databases have legacy codes that may not be easy to modulate based on the evolving capabilities and limitations of clusters. An indepth understanding of the interaction between these database engines and the underlying operating system (OS) can identify a set of characteristics that would be extremely valuable for future research on systems support for these environments. To our knowledge, there is no prior work that has embarked on such a characterization for a clustered database server. Using IBM DB2 Universal Database (UDB) Extended Enterprise Edition (EEE) V7.2 Trial version and TPC-H like/sup 1/ decision support queries, this paper studies numerous issues by evaluating performance on an off-the-shelf Pentium/Linux cluster connected by Myrinet. These include detailed performance profiles of all kernel activities, as well as qualitative and quantitative insights on the interaction between the database engine and the operating system.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124958395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书