2008 International Conference on Parallel Processing - Workshops最新文献

Disparity: Scalable Anomaly Detection for Clusters 差距:集群的可伸缩异常检测

2008 International Conference on Parallel Processing - Workshops Pub Date : 2008-09-08 DOI: 10.1109/ICPP-W.2008.30

N. Desai, Rick Bradshaw, E. Lusk

引用次数: 2

Automatic Performance Model Transformation from UML to C++ 从UML到c++的自动性能模型转换

2008 International Conference on Parallel Processing - Workshops Pub Date : 2008-09-08 DOI: 10.1109/ICPP-W.2008.29

Sabri Pllana, S. Benkner, F. Xhafa, L. Barolli

引用次数: 6

Randomized Hydrodynamic Load Balancing Approach 随机水动力负载平衡方法

2008 International Conference on Parallel Processing - Workshops Pub Date : 2008-09-08 DOI: 10.1109/ICPP-W.2008.8

O. Destanoglu, F. E. Sevilgen

{"title":"Randomized Hydrodynamic Load Balancing Approach","authors":"O. Destanoglu, F. E. Sevilgen","doi":"10.1109/ICPP-W.2008.8","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.8","url":null,"abstract":"Load balancing is performed to achieve the optimal use of the existing computational resources as much as possible whereby none of the resources remains idle while some other resources are being utilized. Balanced load distribution can be achieved by the immigration of the load from the source nodes which have surplus workload to the comparatively lightly loaded destination nodes. Applying load balancing during run time is called dynamic load balancing (DLB). DLB can be realized both in a direct or iterative manner according to the execution node selection. In iterative methods, the final destination node is determined through several iteration steps, while in direct methods it is selected in one step. This paper presents the randomized hydrodynamic load balancing (RHLB) method which is a hybrid method that takes advantage of both direct and iterative methods. Using random load migration as a direct method, RHLB approach intends to solve the problems derived from the exceptional instantaneous load rises, and diffuse the surplus workload to relatively free resources. Besides, using hydrodynamic approach as an iterative method, RHLB aims to consume minimum possible system resources to balance the common workload distributions. The results of the experiments designate that, RHLB outruns other iterative based methods in terms of both balance quality and the total time of the load balancing process.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125948571","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

Weight Bound Limits in Supertasking Approach for Guaranteed Timeline Constraints 保证时间约束下的超任务方法的权限

2008 International Conference on Parallel Processing - Workshops Pub Date : 2008-09-08 DOI: 10.1109/ICPP-W.2008.24

Muhammad Farooq, F. Muller, M. Auguin

引用次数: 0

A Redundant Data Transmission Protocol for a Wireless Sensor Network 一种无线传感器网络冗余数据传输协议

2008 International Conference on Parallel Processing - Workshops Pub Date : 2008-09-08 DOI: 10.1109/ICPP-W.2008.12

A. Aikebaier, T. Enokido, M. Takizawa

{"title":"A Redundant Data Transmission Protocol for a Wireless Sensor Network","authors":"A. Aikebaier, T. Enokido, M. Takizawa","doi":"10.1109/ICPP-W.2008.12","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.12","url":null,"abstract":"In a wireless sensor-actuator network (WSAN), sensor nodes deliver messages with sensed values to only nearby nodes due to weak radio. Messages are forwarded by sensor nodes to an actuator node by a routing protocol like a flooding protocol. In the redundant data transmission (RT) protocol, a sensor node sends a message with not only its sensed value but also sensed values received from other sensor nodes. Each message carries so many number of sensed values that the message loss ratio is not increased. Even if a message with a sensed value v is lost, an actuator node can receive the value v from a message sent by another sensor node. Thus, each sensed value is redundantly carried in multiple messages. The redundancy of a sensed value is in nature increased by broadcasting the value. In order to reduce the redundancy, we take a strategy that the farther sensor nodes from an actuator node forward the fewer number of sensed values. We evaluate the RT protocol in terms of loss ratio, redundancy, and delay time of sensed values. We show that about 80% of sensed values can be delivered to an actuator node even if 95% of messages are lost due to noise and collision.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130371059","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

Iceberg: An Image Streamer for Space and Time Efficient Provisioning of Virtual Machines 冰山:用于空间和时间有效配置虚拟机的图像流

2008 International Conference on Parallel Processing - Workshops Pub Date : 2008-09-08 DOI: 10.1109/ICPP-W.2008.13

Lei Shi, M. Banikazemi, Qingqing Wang

引用次数: 15

Effects of Push-to-Talk (PTT) Delays on Throughput Performance of CSMA/CA Based Distributed Digital Radios (DDR) for Land Mobile Radio (LMR) Networks PTT延迟对基于CSMA/CA的陆地移动无线电(LMR)网络分布式数字无线电(DDR)吞吐量性能的影响

2008 International Conference on Parallel Processing - Workshops Pub Date : 2008-09-08 DOI: 10.1109/ICPP-W.2008.14

Abhijit C. Navalekar, Jitish S. Kolanjery, W. Michalson, J. Matthews

{"title":"Effects of Push-to-Talk (PTT) Delays on Throughput Performance of CSMA/CA Based Distributed Digital Radios (DDR) for Land Mobile Radio (LMR) Networks","authors":"Abhijit C. Navalekar, Jitish S. Kolanjery, W. Michalson, J. Matthews","doi":"10.1109/ICPP-W.2008.14","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.14","url":null,"abstract":"This paper investigates the throughput performance of a CSMA/CA based network of land mobile radios (LMR) over a Rayleigh fading FM channel. The throughput calculations are based on the medium access (MAC)/physical (PHY) cross-layer characteristics for the distributed digital radios (DDR). From PHY-layer perspective, the effects of additive white Gaussian noise (AWGN), Rayleigh fading and push-to-talk (PTT) delays are considered while the MAC-layer perspective includes the performance of carrier sense multiple access with collision avoidance (CSMA/CA) for a half duplex narrowband FM (NBFM) channel. The throughput performance was simulated for channel data rates of 12000 bps in presence of additive white Gaussian noise (AWGN) and Rayleigh fading. Typical values for PTT delays for two of the most commonly used LMR terminals were calculated experimentally. The results show that in addition to fading and number of DDR nodes in a network, the push-to-talk (PTT) delays associated with LMR radios significantly influence the achievable throughput of the system.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124806731","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}

引用次数: 0

A Planner-Guided Scheduling Strategy for Multiple Workflow Applications 多工作流应用的计划器导向调度策略

2008 International Conference on Parallel Processing - Workshops Pub Date : 2008-09-08 DOI: 10.1109/ICPP-W.2008.10

Zhifeng Yu, Weisong Shi

{"title":"A Planner-Guided Scheduling Strategy for Multiple Workflow Applications","authors":"Zhifeng Yu, Weisong Shi","doi":"10.1109/ICPP-W.2008.10","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.10","url":null,"abstract":"Workflow applications are gaining popularity in recent years because of the prevalence of cluster environments. Many algorithms have been developed since, however most static algorithms are designed in the problem domain of scheduling single workflow applications, thus not applicable to a common cluster environment where multiple workflow applications and other independent jobs compete for resources. Dynamic scheduling approaches can handle the mixed workload practically by nature but their performance has yet to optimize as they do not have a global view of workflow applications. Recent research efforts suggest merging multiple workflows into one workflow before execution, but fail to address an important issue that multiple workflow applications may be submitted at different times by different users. In this paper, we propose a planner-guided dynamic scheduling strategy for multiple workflow applications, leveraging job dependence information and execution time estimation.Our approach schedules individual jobs dynamically without requiring merging the workflow applications a priori. The simulation results show that the proposed algorithm significantly outperforms two other algorithms by 43.6% and 36.7% with respect to workflow makespan and turnaround time respectively, and it performs even better when the number of concurrent workflow applications increases and the resources are scarce.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"30 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116337578","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}

引用次数: 121

Optimization of Download Times in a Distributed VOD System 分布式VOD系统中下载时间的优化

2008 International Conference on Parallel Processing - Workshops Pub Date : 2008-09-08 DOI: 10.1109/ICPP-W.2008.27

Anne-Elisabeth Baert, Vincent Boudet, A. Jean-Marie, Xavier Roche

引用次数: 6

A Simulation Framework for Dependable Distributed Systems 可靠分布式系统仿真框架

2008 International Conference on Parallel Processing - Workshops Pub Date : 2008-09-08 DOI: 10.1109/ICPP-W.2008.19

C. Dobre, Florin Pop, V. Cristea

{"title":"A Simulation Framework for Dependable Distributed Systems","authors":"C. Dobre, Florin Pop, V. Cristea","doi":"10.1109/ICPP-W.2008.19","DOIUrl":"https://doi.org/10.1109/ICPP-W.2008.19","url":null,"abstract":"The use of discrete-event simulators in the design and development of distributed systems is appealing due to their efficiency and scalability. Their core abstractions of process and event map neatly to the components and interactions of modern-day distributed systems and allow designing realistic simulation scenarios. MONARC, a multi-threaded, process oriented simulation framework designed for modeling large scale distributed systems, allows the realistic simulation of a wide-range of distributed system technologies, with respect to their specific components and characteristics. In this paper we present an innovative solution to the problem of evaluating the dependability characteristic of distributed systems. Our solution is based on several proposed extensions to the simulation model of the MONARC simulation framework. These extensions refer to fault tolerance and system orchestration mechanisms being added in order to assess the reliability and availability of distributed systems. The extended simulation model includes the necessary components to describe various actual failure situations and provides the mechanisms to evaluate different strategies for replication and redundancy procedures, as well as security enforcement mechanisms.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115572057","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