In distributed and high performance applications it it is necessary to discover the aggregate resource capabilities of the collaborating peers. Another requirement of these applications is to locate the resources meet...
详细信息
ISBN:
(纸本)9781595939975
In distributed and high performance applications it it is necessary to discover the aggregate resource capabilities of the collaborating peers. Another requirement of these applications is to locate the resources meeting the given aggregate search criteria. In this paper we present an unstructured peer-to-peer approach to aggregate node selection for resource management. Our objective is to efficiently calculate the aggregate value and search the aggregate node whose attribute matches or falls in the proximity of this value. Our contribution also includes the inclusion of an explicit network for aggregate query routing. We evaluated our protocol for accuracy, efficiency and communication cost through detailed simulations. Copyright 2008 ACM.
In this work we compare scheduling and coding strategies for a source node serving multiple multicast flows in a network. The coding strategy we consider is a form of random coding proposed in [6] and involves coding ...
详细信息
The testing of Multi Agent systems (MAS) has not been subject to extensive research yet. We build a framework for defining and performing integration tests on a multi agent platform. The framework controls the vital f...
详细信息
This paper presents new power efficient high throughput datapaths for portable multimedia devices. The various datapaths provide support for dense arithmetic operations. This work provides the performance evaluation f...
详细信息
With the immense increase of the data in various fields, interpreting the data into useful information has become a tedious job. Design of models to handle the problem is essential. This paper discusses the methods th...
详细信息
This paper analyses the relationship between the signal delay and the fractional dynamics. It is shown that some experimental signals spectra are approximated by trendlines. Based on the slope of these trendlines the ...
详细信息
Pavements usually experience different types of distress due to repeated traffic loads, aggressive environmental conditions, construction materials, soil condition of the underline subgrade, and the method of construc...
详细信息
Pavements usually experience different types of distress due to repeated traffic loads, aggressive environmental conditions, construction materials, soil condition of the underline subgrade, and the method of construction. Longitudinal and transverse cracking, potholes, rutting, and bleeding are common examples of such distresses associated with flexible pavements. As time progresses, the severity of these distreaaes increases and consequently, ride quality is adversely affected. Early detection and measurement of the extent of distresses coupled with prompt reactive measures are necessary to keep the pavement function at an acceptable level. Traditional methods for distress detection and measurement are laborious, time consuming, and subject the involved personnel to accidents. In contrast, image measurement methods are effortless, safe, and can be performed in a short time. This research paper performs image processing measurements to estimate areas of a pothole and alligator cracking, and sets a program for plane measurements of an area that experience rutting. The image measurements are compared with the traditional measurements. The results show that image measurements are close to those obtained by using the traditional methods.
This paper presents an efficient collision detection algorithm for arbitrary polyhedral objects moving randomly within the virtual environment. We decompose the non-convex objects into some convex pieces using the sur...
详细信息
Processable Bulk Data Transfer (PBDT) tasks are resource intensive concurrent tasks which involve transfer of a very large amount of data that has to be processed in some way before it can be used at a remote set of d...
详细信息
ISBN:
(纸本)9781595938732
Processable Bulk Data Transfer (PBDT) tasks are resource intensive concurrent tasks which involve transfer of a very large amount of data that has to be processed in some way before it can be used at a remote set of destination nodes called the sink nodes. A distributed computing environment, such as the Grid is a popular way to perform these tasks. Focusing on the execution of PBDT tasks in a Grid computing environment, this paper presents an efficient resource allocation mechanism. Due to the resource thirsty nature of these tasks, an efficient resource allocation is essential to perform these tasks while achieving satisfactory performance. The time-complexity of the resource allocation algorithm rises sharply as the available number of resources in the given Grid computing environment is increased making efficient resource allocation a challenge. To meet this challenge, this paper investigates the use of approximate algorithms for the resource allocation. The benefits obtained by using the reduced complexity of the algorithm are weighed against the increased costs incurred during the task execution (due to the inaccuracies in resource allocation introduced by the approximations). This paper describes a number of approximations and discusses under which circumstances such approximations are to be used. The techniques presented in this research can be extended to non-PBDT tasks and other distributed computing environments. Copyright 2008 ACM.
Trip planning search (TPS) represents an important class of queries in Geographic Information systems (GIS). In many real-world applications, TPS requests are issued with a number of constraints. Unfortunately, most o...
详细信息
ISBN:
(纸本)9781605583235
Trip planning search (TPS) represents an important class of queries in Geographic Information systems (GIS). In many real-world applications, TPS requests are issued with a number of constraints. Unfortunately, most of these constrained TPS cannot be directly answered by any of the existing algorithms. By formulating each restriction into rules, we propose a novel form of route query, namely the multi-rule partial sequenced route (MRPSR) query. Our work provides a unified framework that also subsumes the well-known trip planning query (TPQ) and the optimal sequenced route (OSR) query. In this paper, we first prove that MRPSR is NP-hard and then present three heuristic algorithms to search for near-optimal solutions for the MRPSR query. Our extensive simulations show that all of the proposed algorithms can answer the MRPSR query effectively and efficiently. Using both real and synthetic datasets, we investigate the performance of our algorithms with the metrics of the route distance and the response time in terms of the percentage of the constrained points of interest (POI) categories. Compared to the LORD-based brute-force solution, the response times of our algorithms are remarkably reduced while the resulting route length is only slightly longer than the shortest route. Copyright 2008 ACM.
暂无评论