Cluster and grid computing is a relatively new interdisciplinary field, where computerscience, engineering and computational biology are its core supporting disciplines. The rise of cluster and grid computing discipl...
详细信息
ISBN:
(纸本)0780389328
Cluster and grid computing is a relatively new interdisciplinary field, where computerscience, engineering and computational biology are its core supporting disciplines. The rise of cluster and grid computing discipline brings to computerscience faculty members new opportunities and challenges, both in education and in research. In this paper, we explore issues in teaching cluster and grid computing, the developing of curricula, and thoughts to foster student to work on research projects in cluster and grid computing.
In this paper, the authors presented the grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, it is shown that, based on the scope and model of dat...
详细信息
ISBN:
(纸本)0769522491
In this paper, the authors presented the grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, it is shown that, based on the scope and model of data mining applied in the grid environment as well as user equivalent perspective, grid roles can be categorized into three types. It was aimed, through these definitions, to help software developers define clear system processes and differentiate the application scope for software applications. To fulfill the architecture, an existing parallel decision tree algorithm was first applied (the SPRINT algorithm) to the grid environment. The performance and differences in many other areas are compared using datasets of different sizes. The experimental results will be used for future reference and further development.
Discovering and assembling individual Web services into more complex yet new and more useful Web processes receive significant attention from the academia recently. In this paper, we explore using pre and post-conditi...
详细信息
Discovering and assembling individual Web services into more complex yet new and more useful Web processes receive significant attention from the academia recently. In this paper, we explore using pre and post-conditions of Web services to enable their automatic composition. Also, we present a novel technique for discovering semantic relations between pre and post-conditions of different services using their ontological descriptions. This enables determining services with complimentary functions and generating a semantic Web of services. Our technique takes semantic similarity of pre and post-conditions into account and builds on our earlier work on discovering semantic relationships between interfaces (input and output) of Web services.
The paper proposes an energy-aware contention-based protocol for the medium access control (MAC) sub-layer for wireless sensor networks. The innovative approach with frequent sleeps proactively and aggressively reduce...
详细信息
The paper proposes an energy-aware contention-based protocol for the medium access control (MAC) sub-layer for wireless sensor networks. The innovative approach with frequent sleeps proactively and aggressively reduces the wasted energy while increasing the throughput and decreasing the latency. The proposed MAC protocol solves the energy inefficiency caused by idle listening, control-packet overhead, and overhearing. Simulation experiments have been performed to demonstrate the effectiveness of the proposed approach, especially compared to the S-MAC and T-MAC protocols.
Grid and peer-to-peer (P2P) network technologies enable aggregation of distributed resources for solving large-scale and computationally-intensive applications. These technologies are well-suited for bag-of-tasks (BoT...
详细信息
Grid and peer-to-peer (P2P) network technologies enable aggregation of distributed resources for solving large-scale and computationally-intensive applications. These technologies are well-suited for bag-of-tasks (BoT) applications, because each application consists of many parallel and independent tasks. With multiple users competing for the same resources, the key challenge is to finish a user application within a specified deadline. In this paper, we propose a time optimization algorithm that schedules a user application on auction-based resource allocation systems. These allocation systems, which are based on proportional share, allow users to bid higher in order to gain more resource shares. Therefore, this algorithm adjusts a user bid periodically on these systems in order to finish the application on time.
In this paper, we present visual tool for performance measurement and analysis of MPI parallel programs in cluster environments. Most of tools available today for cluster systems show solely system performance data (e...
详细信息
ISBN:
(纸本)0769522491
In this paper, we present visual tool for performance measurement and analysis of MPI parallel programs in cluster environments. Most of tools available today for cluster systems show solely system performance data (e.g., CPU load, memory usage, network bandwidth, machine-room temperature, server average load, among others), being more suitable for system administrators who maintain such system. The visual tool is designed to show performance data of all computer nodes involved in the execution of MPI parallel program, such as CPU load level and memory usage. Additionally, this tool is able to display comparative performance data charts of multiple executions of the application (instrumented with MPI interface) under development.
Over the last few years, grid technologies have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on utility computing models. Users consume these services based on th...
详细信息
Over the last few years, grid technologies have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on utility computing models. Users consume these services based on their QoS (quality of service) requirements. In such "pay-per-use" grids, workflow execution cost must be considered during scheduling based on users' QoS constraints. In this paper, we propose a cost-based workflow scheduling algorithm that minimizes execution cost while meeting the deadline for delivering results. It can also adapt to the delays of service executions by rescheduling unexecuted tasks. We also attempt to optimally solve the task scheduling problem in branches with several sequential tasks by modeling the branch as a Markov decision process and using the value iteration method
Most middleware platforms lack sufficient support to provide reliable references for accessing distributed mobile objects in the context of dynamic environments, or they heavily depend on infrastructure mechanisms lik...
详细信息
Most middleware platforms lack sufficient support to provide reliable references for accessing distributed mobile objects in the context of dynamic environments, or they heavily depend on infrastructure mechanisms like a globally available location service. Based on the fragmented-object model and on our own middleware implementation AspectIX, this paper presents concepts and mechanisms that avoid outdated references for dynamically distributed objects without additional infrastructure services. Our approach is based on time-bound guarantees. Even in the context of malicious nodes and a partial invalidation of references a safe binding of the distributed object is guaranteed if ever possible.
Network intrusion prevention systems provide proactive defense against security threats by detecting and blocking attack-related traffic. This task can be highly complex, and therefore, software-based network intrusio...
详细信息
Recent cybersecurity incidents suggest that Internet worms can spread so fast that in-time human-mediated reaction is not possible, and therefore initial response to cyberattacks has to be automated. The first step to...
详细信息
Recent cybersecurity incidents suggest that Internet worms can spread so fast that in-time human-mediated reaction is not possible, and therefore initial response to cyberattacks has to be automated. The first step towards combating new unknown worms is to be able to detect and identify them at the first stages of their spread. In this paper, we present a novel method for detecting new worms based on identifying similar packet contents directed to multiple destination hosts. We evaluate our method using real traffic traces that contain real worms. Our results suggest that our approach is able to identify novel worms while at the same time the generated false alarms reach as low as zero percent.
暂无评论