An appealing use case of complex event processing (CEP) systems is for mobile users to react in real-time to events in their environment, e.g., to the occurrence of a dangerous situation such as an accident. Maintaini...
详细信息
Stream computing has shown to be an effective technique to decouple communication from computation in many application domains. It provides an efficient mitigation of bandwidth restrictions, by reducing the amount of ...
详细信息
Technology enhancement makes the computing available everywhere and provides access to widely distributed resources which is known as Mobile Computing. Mobile computing enables innovative applications through the shar...
详细信息
ISBN:
(纸本)9781479976836
Technology enhancement makes the computing available everywhere and provides access to widely distributed resources which is known as Mobile Computing. Mobile computing enables innovative applications through the sharing of computing resources among mobile devices such as notebook, smart phones and Personal Digital Assistant (PDAs) without any pre-existing infrastructure. Mobile computing includes a number of technologies and devices. The state of the user, static or mobile, does not affect the information management capability of the mobile platform. A user can continue to access and perform data manipulation during the state of mobility by using mobile computing devices. Delivering data packets between pair of processors is a primary responsibility of any mobile computing network This activity is performed using a routing strategy Maximize reliability of the data packets always a major concern while transmitting the data from one point to another point. In mobile computing it is the process of determining the data path through the network that data packets will move from the one computing device to another computing device. Routing strategy for data transmission is an important factor for achieving high degree of reliability. Multiple data packets are move within a network from source to destination in order to execute on available processing units with the objective of getting maximum reliability of data packets. This research paper present a routing strategy to achieve maximum data packets transmission reliability in mobile computing network during the data transmission.
With the emergence of large social networks, such as Facebook and Twitter, graphs with millions to billions vertices are common. Instead of processing the network within a single machine, all the applications related ...
详细信息
Graph processing has become an integral part of big data analytics. With the ever increasing size of the graphs, one needs to partition them into smaller clusters, which can be managed and processed more easily on mul...
详细信息
ISBN:
(纸本)9783662433522;9783662433515
Graph processing has become an integral part of big data analytics. With the ever increasing size of the graphs, one needs to partition them into smaller clusters, which can be managed and processed more easily on multiple machines in a distributed fashion. While there exist numerous solutions for edge-cut partitioning of graphs, very little effort has been made for vertex-cut partitioning. This is in spite of the fact that vertex-cuts are proved significantly more effective than edge-cuts for processing most real world graphs. In this paper we present JA-BEJA- VC, a parallel and distributed algorithm for vertex-cut partitioning of large graphs. In a nutshell, JA-BE-JA-VC is a local search algorithm that iteratively improves upon an initial random assignment of edges to partitions. We propose several heuristics for this optimization and study their impact on the final partitioning. Moreover, we employ simulated annealing technique to escape local optima. We evaluate our solution on various graphs and with variety of settings, and compare it against two state-of-the-art solutions. We show that JA-BE-JA-VC outperforms the existing solutions in that it not only creates partitions of any requested size, but also requires a vertex-cut that is better than its counterparts and more than 70% better than random partitioning.
Graph processing has become popular for various big data analytic applications. Google's Pregel framework enables vertex-centric graph processing in distributed environment based on Bulk Synchronous parallel (BSP)...
详细信息
ISBN:
(纸本)9781479940936
Graph processing has become popular for various big data analytic applications. Google's Pregel framework enables vertex-centric graph processing in distributed environment based on Bulk Synchronous parallel (BSP) model. However, the BSP model is inefficient for many complex graph algorithms requiring graph traversals, as only a small number of vertices really update states in each superstep. In this paper, we propose an hierarchical parallelization mechanism, taking the advantages of both synchronous (warp-level) and asynchronous (task-level) parallelization approaches. In addition, a runtime task scheduling mechanism is proposed, relying on real-time monitoring or prediction of resource utilization. Experiments have verified that the hierarchical parallelization mechanism can expose greater parallelism, and thus, increase resource utilization significantly. Moreover, the runtime scheduling mechanism can avoid aggressive resource competition, and thus, further enhance the performance of the parallelized graph processing.
We present FooPar, an extension for highly efficient parallel Computing in the multi-paradigm programming language Scala. Scala offers concise and clean syntax and integrates functional programming features. Our frame...
详细信息
ISBN:
(数字)9783642551956
ISBN:
(纸本)9783642551956
We present FooPar, an extension for highly efficient parallel Computing in the multi-paradigm programming language Scala. Scala offers concise and clean syntax and integrates functional programming features. Our framework FooPar combines these features with parallel computing techniques. FooPar is designed to be modular and supports easy access to different communication backends for distributed memory architectures as well as high performance math libraries. In this article we use it to parallelize matrix-matrix multiplication and show its scalability by a isoefficiency analysis. In addition, results based on a empirical analysis on two supercomputers are given. We achieve close-to-optimal performance wrt. theoretical peak performance. Based on this result we conclude that FooPar allows programmers to fully access Scalas design features without suffering from performance drops when compared to implementations purely based on C and MPI.
Today many applications are developed using distributed technologies such as cluster, cloud and grid computing. These applications demand more resources for computation and storage. They demand flexible scaling and im...
详细信息
ISBN:
(纸本)9781479930807
Today many applications are developed using distributed technologies such as cluster, cloud and grid computing. These applications demand more resources for computation and storage. They demand flexible scaling and improved performance. Application now days can make use of multiple nodes (machines) to get the tasks completed. In this paper we discuss the, implementation details of a grid computing framework known as GridSys. This framework provides a fast and easy way to program a grid. It can easily help the application break the problem to compute intensive tasks. The framework distributes these tasks to different nodes of the grid efficiently and easily aggregate the results of these tasks provide fault tolerance and reliability.
In mobile sensor networks (MSNs), since sensor nodes and wireless networks are highly resource constrained and, it is highly required to manage sensor data in flexible and efficient manners. Under the MEXT research pr...
详细信息
ISBN:
(纸本)9781479926527
In mobile sensor networks (MSNs), since sensor nodes and wireless networks are highly resource constrained and, it is highly required to manage sensor data in flexible and efficient manners. Under the MEXT research project(1) entitled "Studies on Efficient Data processingtechniques for Mobile Sensor Networks," we have conducted researches on data management issues in MSNs. In this paper, we report some of our achievements in a sub-area of this project, which addresses data transmission for efficient data collection in MSNs. In particular, we first show our achievements on how to efficiently transmit sensor data from sensor nodes to mobile sink nodes considering the fairness and the amount of sensor data collected. Then, we also show our achievements on how to enlarge sensor data collection area and how to reduce communication traffic using mobile sink nodes.
This paper discusses distributed approaches for the solution of random convex programs (RCPs). RCPs are convex optimization problems with a (usually large) number N of randomly extracted constraints;they arise in seve...
详细信息
This paper discusses distributed approaches for the solution of random convex programs (RCPs). RCPs are convex optimization problems with a (usually large) number N of randomly extracted constraints;they arise in several application areas, especially in the context of decision-making under uncertainty;see [G. C. Calafiore, SIAM J. Optim., 20 (2010), pp. 3427-3464;G. C. Calafiore and M. C. Campi, IEEE Trans. Automat. Control, 51 (2006), pp. 742-753]. We here consider a setup in which instances of the random constraints (the scenario) are not held by a single centralized processing unit, but are instead distributed among different nodes of a network. Each node "sees" only a small subset of the constraints, and may communicate with neighbors. The objective is to make all nodes converge to the same solution as the centralized RCP problem. To this end, we develop two distributed algorithms that are variants of the constraints consensus algorithm [G. Notarstefano and F. Bullo, Proceedings of the 46th IEEE conference on Decision and Control, New Orleans, LA, 2007, pp. 927-932;G. Notarstefano and F. Bullo, IEEE Trans. Automat. Control, 56 (2011), pp. 2247-2261]: the active constraints consensus algorithm, and the vertex constraints consensus (VCC) algorithm. We show that the active constraints consensus algorithm computes the overall optimal solution in finite time, and with almost surely bounded communication at each iteration of the algorithm. The VCC algorithm is instead tailored for the special case in which the constraint functions are convex also with respect to the uncertain parameters, and it computes the solution in a number of iterations bounded by the diameter of the communication graph. We further devise a variant of the VCC algorithm, namely quantized vertex constraints consensus (qVCC), to cope with the case in which communication bandwidth among processors is bounded. We discuss several applications of the proposed distributedtechniques, including estimation
暂无评论