2012 IEEE 32nd International Conference on Distributed Computing Systems最新文献_第8页

sfatables: A Firewall-like Policy Engine for Federated Systems stabables:联邦系统的类似防火墙的策略引擎

2012 IEEE 32nd International Conference on Distributed Computing Systems Pub Date : 2011-06-20 DOI: 10.1109/ICDCS.2011.58

S. Bhatia, A. Bavier, L. Peterson, Soner Sevinc

引用次数: 3

Software-Directed Data Access Scheduling for Reducing Disk Energy Consumption 软件定向数据访问调度，降低磁盘能耗

2012 IEEE 32nd International Conference on Distributed Computing Systems Pub Date : 2011-06-08 DOI: 10.1145/1996130.1996175

Yuanrui Zhang, Jun Liu, M. Kandemir

{"title":"Software-Directed Data Access Scheduling for Reducing Disk Energy Consumption","authors":"Yuanrui Zhang, Jun Liu, M. Kandemir","doi":"10.1145/1996130.1996175","DOIUrl":"https://doi.org/10.1145/1996130.1996175","url":null,"abstract":"Most existing research in disk power management has focused on exploiting idle periods of disks. Both hardware power-saving mechanisms (such as spin-down disks and multi-speed disks) and complementary software strategies (such as code and data layout transformations to increase the length of idle periods) have been explored. However, while hardware power-saving mechanisms cannot handle short idle periods of high-performance parallel applications, prior code/data reorganization strategies typically require extensive code modifications. In this paper, we propose and evaluate a compiler-directed data access (I/O call) scheduling framework for saving disk energy, which groups as many data requests as possible in a shorter period, thus creating longer disk idle periods for improving the effectiveness of hardware power-saving mechanisms. As compared to prior software based efforts, it requires no code or data restructuring. We evaluate our approach using six application programs in a cluster-based simulation environment. The experimental results show that it improves the effectiveness of both spin-down disks and multi-speed disks with doubled power savings on average.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"17 1","pages":"596-605"},"PeriodicalIF":0.0,"publicationDate":"2011-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86005351","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}

引用次数: 5

Approximate Data Stream Joins in Distributed Systems 分布式系统中的近似数据流联接

2012 IEEE 32nd International Conference on Distributed Computing Systems Pub Date : 2007-01-01 DOI: 10.1109/ICDCS.2007.104

V. Kriakov, A. Delis, G. Kollios

{"title":"Approximate Data Stream Joins in Distributed Systems","authors":"V. Kriakov, A. Delis, G. Kollios","doi":"10.1109/ICDCS.2007.104","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.104","url":null,"abstract":"The emergence of applications producing continuous high-frequency data streams has brought forth a large body of research in the area of distributed stream processing. In presence of high volumes of data, efforts have primarily concentrated on providing approximate aggregate or top-k type results. Scalable solutions for providing answers to window join queries in distributed stream processing systems have received limited attention to date. We provide a solution for the window join in a distributed stream processing system which features reduced inter-node communications achieved through automatic throughput handling based on resource availability. Our approach is based on incrementally updated discrete Fourier transforms (DFTs). Furthermore, we provide formulae for computing DFT compression factors in order to achieve information reduction. We perform WAN-based prototype experiments to ascertain the viability and establish the effectiveness of our method. Our experimental results reveal that our method scales in terms of throughput and error rates, achieving sub-linear message complexity in domains that exhibit a geographic skew in the joining attributes.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"4 1","pages":"5"},"PeriodicalIF":0.0,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76021237","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}

引用次数: 2

eScience Meets eBusiness: Blueprint for Next Generation Grid Computing eScience遇见电子商务:下一代网格计算的蓝图

2012 IEEE 32nd International Conference on Distributed Computing Systems Pub Date : 2005-06-06 DOI: 10.1109/ICDCS.2005.33

Hiromu Hayashi

{"title":"eScience Meets eBusiness: Blueprint for Next Generation Grid Computing","authors":"Hiromu Hayashi","doi":"10.1109/ICDCS.2005.33","DOIUrl":"https://doi.org/10.1109/ICDCS.2005.33","url":null,"abstract":"Summary form only given. Grid computing is increasingly being viewed as the next phase of distributed computing. Built on pervasive Internet standards, grid computing enables organizations to share computing and information resources across department and organizational boundaries in a secure, highly efficient manner. Grid computing originates in eScience and its early development was driven to a large extent by the requirements of large-scale computing and efficient sharing of huge datasets. eBusiness requirements led to the adoption of emerging Web services technologies - initially developed for distributed business application integration. Therefore grid computing can be applied to enterprise computing within and across organizations and pave the way for utility computing. I present major Grid computing projects for both eScience and eBusiness in Japan (including NaReGI and Business Grid) and several key Grid products and applications (including CyberGRIP and Resource Coordinator both developed by Fujitsu). The Global Grid Forum (GGF) is leading the standardization of grid computing. In particular, GGF has developed the Open Grid Services Architecture (OGSA) and is working throughout the industry to champion this \"architectural blueprint\" and the associated specifications that will enable the pervasive adoption of grid computing for eBusiness and eScience worldwide","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"16 1","pages":"529"},"PeriodicalIF":0.0,"publicationDate":"2005-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73551715","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

Distributed Computation in the Physical World 物理世界中的分布式计算

2012 IEEE 32nd International Conference on Distributed Computing Systems Pub Date : 2005-06-06 DOI: 10.1109/ICDCS.2005.25

D. Culler

引用次数: 1

Effective complexity reduction for optimal scheduling of distributed real-time applications 有效降低分布式实时应用优化调度的复杂度

2012 IEEE 32nd International Conference on Distributed Computing Systems Pub Date : 1999-05-31 DOI: 10.1109/ICDCS.1999.776538

J. Jönsson

{"title":"Effective complexity reduction for optimal scheduling of distributed real-time applications","authors":"J. Jönsson","doi":"10.1109/ICDCS.1999.776538","DOIUrl":"https://doi.org/10.1109/ICDCS.1999.776538","url":null,"abstract":"The application of optimal search strategies to scheduling for distributed real-time systems is, in general, plagued by an inherent computational complexity. This has effectively prevented the integration of strategies such as branch-and-bound (B&B) in scheduling frameworks and tools used in practice today. To show that optimal scheduling is, in fact, a viable alternative for many real-time scheduling scenarios, we propose an approach that can reduce the average search complexity to levels comparable with that of a polynomial-time heuristic. Our approach is based on making intelligent choices in the selection of strategies for search tree vertex traversal and task deadline assignment. More specifically, we conjecture that effective complexity reduction is achieved by (i) traversing vertices in the search tree in a depth-first fashion and (ii) assigning local task deadlines that are non-overlapping fractions of the application end-to-end deadline. Through an extensive experimental study, we find that our approach contribute to reducing the average search complexity by several orders of magnitude for a frequently-used class of distributed real-time applications.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"64 1 1","pages":"360-369"},"PeriodicalIF":0.0,"publicationDate":"1999-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87744524","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}

引用次数: 8

Group Communication Support for Distributed Multimedia and CSCW Systems 分布式多媒体和CSCW系统的群通信支持

2012 IEEE 32nd International Conference on Distributed Computing Systems Pub Date : 1997-01-01 DOI: 10.1109/ICDCS.1997.597851

I. Rhee, S. Y. Cheung, P. Hutto, V. Sunderam

引用次数: 21

A Distributed Scalable Web Server and Its Program Visualization in Multiple Platforms 分布式可扩展Web服务器及其多平台程序可视化

2012 IEEE 32nd International Conference on Distributed Computing Systems Pub Date : 1996-01-01 DOI: 10.1109/ICDCS.1996.508018

Yew-Huey Liu, P. Dantzig, C. Wu, J. Challenger, L. Ni

引用次数: 1

Future Distributed Embedded and Real-Time Applications Will Be Adaptive: Meanings, Challenges and Research Paradigms (Panel) 未来分布式嵌入式和实时应用将是自适应的:意义、挑战和研究范式(小组讨论)

2012 IEEE 32nd International Conference on Distributed Computing Systems Pub Date : 1995-05-30 DOI: 10.1109/ICDCS.1995.500018

A. Mok, C. Heitmeyer, K. Jeffay, Michael B. Jones, C. D. Locke, R. Rajkumar

引用次数: 0

Computer Supported Cooperative Work: New Challenges or Old Problems (Panel) 计算机支持的协同工作:新挑战还是老问题(小组讨论)

2012 IEEE 32nd International Conference on Distributed Computing Systems Pub Date : 1995-01-01 DOI: 10.1109/ICDCS.1995.10001

Tom Rodden, Paul Dourish, L. Fahlén, Chris Greenhalgh, A. Prakash, John Riedl

引用次数: 0