Hadoop Performance Modeling for Job Estimation and Resource Provisioning
MapReduce has become a major computing model for data intensive applications. Hadoop, an open source implementation of MapReduce, has been adopted by an increasingly growing user community. Cloud computing service providers such as Amazon EC2 Cloud offer the opportunities for Hadoop users to lease a certain amount of resources and pay for their use. However, […]
A Learning Algorithm for Bayesian Networks and Its Efficient Implementation on GPU
The wide application of omics research has produced a burst of biological data in recent years, which has in turn increased the need to infer biological networks from data. Learning biological networks from experimental data can help detect and analyze aberrant signaling pathways, which can be used in diagnosis of diseases at an early stage. […]
Service Operator-Aware Trust Scheme for Resource Matchmaking across Multiple Clouds
This paper proposes a service operator-aware trust scheme (SOTS) for resource matchmaking across multiple clouds. Through analyzing the built-in relationship between the users, the broker, and the service resources , this paper proposes a middleware framework of trust management that can effectively reduces user burden and improve system dependability. Based on multidimensional resource service operators, we model […]
HEADS-JOIN: Efficient Earth Mover’s Distance Similarity Joins on Hadoop
The Earth Mover’s Distance (EMD) similarity join has a number of important applications such as near duplicate image retrieval and distributed based pattern analysis. However, the computational cost of EMD is super cubic and consequently the EMD similarity join operation is prohibitive for datasets of even medium size. We propose to employ the Hadoop platform to speed […]
Accelerating Irregular Computation in Massive Short Reads Mapping on FPGA Co-processor
Because there is an enormous amount of genomic data, next-generation sequencing (NGS) applications pose significant challenges to current computing systems. In this study, we investigate both algorithmic and architectural strategies to accelerate an NGS data analysis algorithm–short read mapping on commodity multi-core platform and customizable FPGA (field programmable gate array) co-processor architecture, respectively. A workload analysis […]
Routing Pressure: A Channel-Related and Traffic-Aware Metric of Routing Algorithm
How to precisely measure performance of routing algorithm is an important issue when studying routing algorithm of network-on-chip (NoC). The degree of adaptiveness is the most widely used metric in the literature. However, our study shows that the degree of adaptiveness cannot precisely measure performance of routing algorithm 1 deposit casino nz.com. It cannot account […]
Neighbor Similarity Trust against Sybil Attack in P2P E-Commerce
Peer to peer (P2P) e-commerce applications exist at the edge of the Internet with vulnerabilities to passive and active attacks. These attacks have pushed away potential business firms and individuals whose aim is to get the best benefit in e-commerce with minimal losses. The attacks occur during interactions between the trading peers as a transaction […]
Distributed Topological Convex Hull Estimation of Event Region in Wireless Sensor Networks without Location Information
In critical event (e.g., fire or gas) monitoring applications of wireless sensor networks (WSNs), convex hull of the event region is an efficient tool in handling the usual tasks like event report, routes reconstruction and human motion planning. Existing works on estimating convex hull of event region usually require location information of sensor nodes, which […]
Towards Distributed Optimal Movement Strategy for Data Gathering in Wireless Sensor Networks
In this paper, we address how to design a distributed movement strategy for mobile collectors, which can be either physical mobile agents or query/collector packets periodically launched by the sink, to achieve successful data gathering in wireless sensor networks. Formulating the problem as general random walks on a graph composed of sensor nodes, we analyze how much […]
Switch-Centric Data Center Network Structures Based on Hypergraphs and Combinatorial Block Designs
Fat trees are considered suitable structures for data center interconnection networking. Such structures are rigid, and hard to scale up and scale out. A good data center network structure should have high scalability, efficient switch utilization, and high reliability. In this paper we present a class of data center network structures based on hypergraph theory […]
