Algorithms and Architectures for Parallel Processing 14th International Conference ICA3PP 2014 Dalian China August 24 27 2014 Proceedings Part II 1st Edition by Xian He Sun, Wenyu Qu, Ivan Stojmenovic, Wanlei Zhou, Zhiyang Li, Hua Guo, Geyong Min, Tingting Yang, Yulei Wu, Lei Liu 3319111940 9783319111940

Algorithms and Architectures for Parallel Processing 14th International Conference ICA3PP 2014 Dalian China August 24 27 2014 Proceedings Part II 1st Edition by Xian He Sun, Wenyu Qu, Ivan Stojmenovic, Wanlei Zhou, Zhiyang Li, Hua Guo, Geyong Min, Tingting Yang, Yulei Wu, Lei Liu – Ebook PDF Instant Download/DeliveryISBN:  3319111940, 9783319111940 

Full download Algorithms and Architectures for Parallel Processing 14th International Conference ICA3PP 2014 Dalian China August 24 27 2014 Proceedings Part II 1st Edition after payment.

Product details:

ISBN-10 :  3319111940 

ISBN-13 :  9783319111940

Author:  Xian He Sun, Wenyu Qu, Ivan Stojmenovic, Wanlei Zhou, Zhiyang Li, Hua Guo, Geyong Min, Tingting Yang, Yulei Wu, Lei Liu 

This two volume set LNCS 8630 and 8631 constitutes the proceedings of the 14th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2014, held in Dalian, China, in August 2014. The 70 revised papers presented in the two volumes were selected from 285 submissions. The first volume comprises selected papers of the main conference and papers of the 1st International Workshop on Emerging Topics in Wireless and Mobile Computing, ETWMC 2014, the 5th International Workshop on Intelligent Communication Networks, IntelNet 2014, and the 5th International Workshop on Wireless Networks and Multimedia, WNM 2014. The second volume comprises selected papers of the main conference and papers of the Workshop on Computing, Communication and Control Technologies in Intelligent Transportation System, 3C in ITS 2014, and the Workshop on Security and Privacy in Computer and Network Systems, SPCNS 2014.

Algorithms and Architectures for Parallel Processing 14th International Conference ICA3PP 2014 Dalian China August 24 27 2014 Proceedings Part II 1st Table of contents:

Parallel Data Processing in Dynamic Hybrid Computing Environment Using MapReduce
1 Introduction
2 Background and Related Work
2.1 MapReduce
2.2 MapReduce on Non-dedicated Computing Resources
3 System Architecture
3.1 General Overview
3.2 Design Overview of HybridDFS
3.3 MapReduce Algorithm and Implementation
4 Performance Evaluation
4.1 Platform Description
4.2 Throughput of HybridDFS I/O
4.3 MapReduce Job Completion Time
4.4 Scheduler Optimization
4.5 Fault-Tolerance
5 Conclusion
References
Fast Scalable k-means++ Algorithm with MapReduce
1 Introduction
2 Preliminaries
3 Our Method
3.1 Parallel Scalable k-means++ with MapReduce
3.2 Oversampling and Refining
3.3 Discussion
4 Experiments
4.1 Running Time
4.2 Clustering Cost
4.3 I/O Cost and Network Cost
4.4 Running Time and Clustering Cost with Different o
5 Conclusion
References
Acceleration of Solving Non-Equilibrium Ionization via Tracer Particles and MapReduce on Eulerian Me
1 Introduction
2 Background and Related Works
2.1 MapReduce Model for Reconstructing and Analyzing Particle Trajectories
2.2 Space-Partition Method for IO Acceleration and in Situ Analysis
3 Method
3.1 Architecture
3.2 Post-processing Scheme
3.3 In Situ Scheme
3.4 Implementation
4 Evaluation
4.1 Performance Analysis
4.2 Overhead Introduced by Tracer Particles
4.3 Overhead Introduced by Post-processing
5 Conclusion and Future Work
References
A Continuous Virtual Vector-Based Algorithm for Measuring Cardinality Distribution
1 Introduction
2 Related Work
2.1 Bitmap
2.2 Virtual Vector
3 Our Algorithm
3.1 Online Processing
3.2 Offline Processing
3.3 Performance Analysis
4 Experiment
4.1 Data Source
4.2 Parameter Analysis and Setting
4.3 Experiment Results
5 Conclusion
References
Hmfs: Efficient Support of Small Files Processing over HDFS
1 Introduction
2 Related Work
3 Small Files Problem in HDFS
4 The Design of Hmfs
4.1 File Operation Interface
4.2 File Tasks
4.3 Buffer Structure
5 Optimization Strategy
5.1 File Prefetching and Caching
5.2 Buffer Replacement Mechanism
6 Experimental Evaluation
6.1 Experimental Environment
6.2 Memory Usage Analysis
6.3 Upload Efficiency Analysis
6.4 Download Efficiency Analysis
7 Conclusion
References
Utilizing Multiple Xeon Phi Coprocessors on One Compute Node
1 Introduction
2 Background
2.1 Xeon Phi Coprocessor
2.2 Pragma-Based Offloading
2.3 COI and SCIF
2.4 Coprocessor-Only Usage Mode
3 Related Work
4 Two Implementations of a Simple 3D Stencil
4.1 Implementation Based on Pragmas
4.2 Implementation Based on COI and SCIF
5 Experiments and Results
5.1 Hardware Platform
5.2 Bandwidth Tests
5.3 Performance of a Real-World 3D Application
6 Conclusions
References
HPSO: Prefetching Based Scheduling to Improve Data Locality for MapReduce Clusters
1 Introduction
2 Background and Motivation
2.1 MapReduce Programming Framework
2.2 Hadoop Scheduler
2.3 Motivation
3 Prefetching
3.1 Buffer Management
4 HPSO Design and Implementation
4.1 Framework
4.2 Node Prediction
4.3 Scheduling Policy
4.4 Prefetching Module
5 Evaluation
5.1 Performance of HPSO
5.2 Scaling Performance
6 Related Work
7 Conclusion
References
Service Scheduling Algorithm in Vehicle Embedded Middleware
1 Introduction
2 Related Work
3 Architecture of Service-Oriented Vehicular Middleware
4 Service Scheduling Algorithm
4.1 Basic Concepts and Definitions
4.2 Priority Allocation Algorithm Based on Criticality Level
5 Experimental Analysis
5.1 Experiment Parameter
5.2 Experimental Analysis
6 Conclusion
References
Similar Samples Cleaning in Speculative Multithreading*
1 Introduction
2 Characterizing the PROG
2.1 Extracting Feature Vectors
2.2 Presenting the Solving Scheme
3 Assessing the Overall Similarity
3.1 Mechanism of Similarity Calculation
3.2 Model of Respective Similarity Assessment
3.3 Similarity Measurement Using Fuzzy Function
3.4 Cleaning of Similar Samples
4 Experimental Evaluation
4.1 Experimental Setup
4.2 Static Features Extraction
4.3 Similarity Calculation
4.4 Similarity Assessment
4.5 Similar Samples Cleaning and Evaluation
4.6 Analysis of the Models
5 Related Work
6 Conclusions and Future Work
References
Equi-join for Multiple Datasets Based on Time Cost Evaluation Model
1 Introduction
2 Related Work
2.1 Equi-join on Single Attribute
2.2 Equi-join on Multiple Attributes
3 The Extended Time Cost Model for Equi-join
3.1 The Time Cost Model for Single MRJ
3.2 The Time Cost of an Equi-join for Single MRJ on Single Attribute
3.3 The Time Cost of an Equi-join for Single MRJ on Multiple Attributes
4 The Optimization Methods for an Equi-join
4.1 Optimization Methods for Star Pattern Sub-joins and Chain Pattern Sub-joins
4.2 The Optimization Method by Dynamic Programming
5 Experiments
5.1 The Environment in Experiments
5.2 The Experiments for a Hybrid Equi-join with Star Pattern Sub-joins
5.3 Experiments for Hybrid Equi-joins without Star Pattern Sub-joins
5.4 Experiments for Chain Pattern Joins
6 Conclusion
References
Identifying File Similarity in Large Data Sets by Modulo File Length
1 Introduction
2 Related Work
3 Background
3.1 Simhash Algorithm
4 Position-Aware Similarity Algorithm
4.1 Traditional Sampling Algorithm
4.2 PAS Algorithm
5 Evaluation
5.1 Evaluation Environment
5.2 Parameters Selection
5.3 PAS Algorithm Evaluation
6 Conclusion
References
Conpy: Concolic Execution Engine for Python Applications
1 Introduction
2 Related Work
3 Design
3.1 Principles
3.2 Scheme
4 Implementation
4.1 Manipulation of int
4.2 Manipulation of str
4.3 Symbol Propagation between str and int
5 Experiments
5.1 Setup
5.2 Results
6 Conclusion
References
A Platform for Stock Market Simulation with Distributed Agent-Based Modeling
1 Introduction
2 Related Works
3 PSSPAM Platform for Distributed Environments
3.1 Logical Architecture of PSSPAM
3.2 Communication System
3.3 Agents Module
3.4 Market Module
4 Experiments
5 Summary and Future Work
References
C2CU : A CUDA C Program Generator for Bulk Execution of a Sequential Algorithm
1 Introduction
2 The Bulk Execution of Sequential Algorithms on the UMM
3 Our C2CU Converter
4 Experiment Results
5 Conclusion
References
Dynamically Spawning Speculative Threads to Improve Speculative Path Execution
1 Introduction
2 Overview of Dynamic Speculative Path Scheme
3 Compiler Phase
3.1 Frequent Path Selection
3.2 Path-Based Thread Partitioning
3.3 Thread Creation and TLS-Enhancing Optimization
4 Runtime Phase
4.1 TLS Execution Model
4.2 Construction of Dynamic Speculative Path
4.3 Speculative Path Prediction and Thread Scheduling
5 Experimental Results
5.1 Subpath Candidates and Pre-computation
5.2 Performance of Dynamic Speculative Path Selection
6 Related Work
7 Conclusions
References
A Parallel Algorithm of Kirchhoff Pre-stack Depth Migration Based on GPU
1 Introduction
2 Overview of CUDA
3 KPSDM Parallel Algorithm
3.1 KPSDM Theory
3.2 Serial Algorithm
3.3 CUDA Parallel Algorithm
3.4 Optimizing Strategy
4 Experiments Result and Analysis
5 Conclusion and Future Work
References
An Algorithm to Embed a Family of Node-Disjoint 3D Meshes into Locally Twisted Cubes
1 Introduction
2 Preliminaries
3 Embedding Two Node-Disjoint 2 × 2 × 2n−3 Meshes into the n-Dimensional Locally Twisted Cubes
4 Embedding Four 4 × 2 × 2n−5 Meshes into the n-Dimensional Locally Twisted Cubes
5 Conclusions
References
GPU Acceleration of Finding Maximum Eigenvalue of Positive Matrices
1 Introduction
2 An Overview of CUDA
3 The Parallel Algorithm of Similarity Transformation (PA-ST)
3.1 Similarity Transformation and Theoretical Foundation
3.2 Parallel Algorithm Using Similarity Transformation (PA-ST)
4 Complexity Analysis
4.1 The Time Complexity of Sequential Algorithm
4.2 The Time Complexity of Parallel Algorithm
5 Experimental Results
6 Conclusion
References
Improving Speculation Accuracy with Inter-thread Fetching Value Prediction
1 Introduction
2 Related Works
3 Inter-thread Fetching Value Prediction
3.1 Thread Isolation
3.2 Fetching CVAR from Another Speculative Thread
4 Implementation of IFVP
4.1 Overview of HEUSPEC
4.2 Integrating IFVP Predictor with HEUSPEC
5 Experiment and Evaluation
5.1 Experiment Results
6 Conclusion
References
Towards Efficient Distributed SPARQL Queries on Linked Data
1 Introduction
2 Related Work
2.1 Query Decomposition
2.2 Query Optimization
3 Federated SPARQL Query
3.1 Query Decomposition
3.2 Cardinality Estimation
3.3 Join Reordering
3.4 Join Execution
4 Evaluations
4.1 Evaluation of Join Execution
4.2 Comparison with Other Federated SPARQL Query Systems
5 Conclusions
References
MRFS: A Distributed Files System with Geo-replicated Metadata
1 Introduction
2 Related Work
3 The Design and Implementation of MRFS
3.1 Overview of MRFS
3.2 The Client Module of MRFS
3.3 The Namespace Server of MRFS
3.4 The Metadata Server of MRFS
4 Experiments and Results
4.1 Experiment Setup
4.2 Experiment Results
5 Conclusion and Future Work
References
An Advanced Data Redistribution Approach to Accelerate the Scale-Down Process of RAID-6
1 Introduction
2 Background and Motivation
2.1 Desired Scaling Features in RAID-6
2.2 Existing Fast Scaling Approaches
2.3 The Motivation
3 The ADR Approach
3.1 Disk Labeling
3.2 Stripe Generation
3.4 Data Addressing
3.5 Properties of ADR
4 Scalability Analysis
4.1 Evaluation Methodology
4.2 Numerical Results
4.3 Analysis
5 Conclusions
References
Thread Mapping and Parallel Optimization for MIC Heterogeneous Parallel Systems
1 Introduction
2 Overview of the MIC
2.1 MIC Architecture
2.2 MIC Programming Pattern
3 Thread Mapping on MIC
3.1 Different Thread Mapping Methods
3.2 Measurement and Findings
4 Performance Optimization
4.1 Benchmarks
4.2 Implementation
4.3 Comprehensive Performance Optimization
4.4 Experimental Results and Analysis
5 Related Work
6 Conclusions
References
Efficient Storage Support for Real-Time Near-Duplicate Video Retrieval
1 Introduction
2 Backgrounds and Related Work
2.1 Feature Representation
2.2 Locality Sensitive Hashing
2.3 Cuckoo Hashing
3 The Design of FastVR
3.1 Compact Feature Representation
3.2 The Semi-random Holistic Hashing
4 Performance Evaluation
4.1 Experiment Setup
4.2 Results and Analysis
5 Conclusion
References
Repairing Multiple Data Losses by Parallel Max-min Trees Based on Regenerating Codes in Distributed
1 Introduction
2 Related Work
3 Network Model for Regenerating Multiple Data Losses
4 Parallel Regeneration for Multiple Data Losses Using Max-min trees Based on MSR Code
4.1 Parallel Regeneration Scheme for Multiple Max-min Trees
4.2 Max-min Tree vs. Maximum Spanning Tree
4.3 Bandwidth-Sharing Max-min Algorithm for Parallel Regenerating Multiple Data Losses
5 Simulation Experiment
6 Conclusion
References
Exploiting Content Locality to Improve the Performance and Reliability of Phase Change Memory
1 Introduction
2 Background and Motivation
2.1 PCM Basics
2.2 Data Deduplication
2.3 Motivation
3 CA-PCM
3.1 Design Objective
3.2 System Overview
3.3 Request Processing Workflow
3.4 Data Consistency Issue
4 Performance Evaluation
4.1 Experimental Setup and Methodology
4.2 Performance Results and Analysis
4.3 Overhead Analysis
5 Related Work
6 Conclusion and Future Work
References
Computing, Communication and ControlTechnologies in Intelligent Transportation System(3C in ITS 2014
Application of Support Vector Machine in the Decision-Making of Maneuvering
1 Introduction
2 Basic Principle of Support Vector Machine
3 Seakeeping Evaluation Based on Support Vector Machine
3.1 Model of the Process
3.2 Determine the Seakeeping Evaluation Indicators
3.3 The Pretreatment of the Sample Data
3.4 Parameter Selection
3.5 Model Training and the Result Analysis
4 Ship Maneuvering Decisions
5 Conclusion
References
Mobile Phone Data Reveal the Spatiotemporal Regularity of Human Mobility
1 Introduction
2 Data
3 Result
3.1 Spatial Properties
3.2 Temporal Properties
3.3 Application
4 Discussion
References
Research on Large-Scale Vessel Riding Tidal Current to Promote Efficiency of Fairway
1 Introduce
2 Under Keel Clearance and Factors Considered in Determining UKC
2.1 Under Keel Clearance
2.2 Factors Considered in Determining UKC
3 The Ship’s Squat
3.1 Quantity of Navigating Squat
3.2 Analysis of Squat Based on Hydromechanics
4 Calculation Method for Squat
4.1 Details and Comparisons of Empirical Formula about Squat
4.2 Squat Difference When the Vessel Is Riding the Tidal Stream
5 Mathematical Model for Squat
5.1 Establishment of Mathematical Model
5.2 Analysis on Results from Actual Ship Considering the Tidal Current
6 Conclusion
References
A Vertex-Clustering Algorithm Based on the Cluster-Clique
1 Introduction
2 Definitions and Notations
3 MV-ICR Clustering Approach
4 Improvement of MV-ICR Clustering Approach
5 Algorithm Analysis and Examples
5.1 Algorithm Analysis
5.2 Example
6 Conclusions
References
Designed Slide Mode Controller for Ship Autopilot with Steering Gear Saturation*
1 Introduction
2 Problem Formulation
2.1 System Description
2.2 Ship Motion Mathematical Model
2.3 Steering Gear Dynamic Model
2.4 Wind Forces and Moment
2.5 Descriptions of Nonlinear Systems
3 Design Ship Nonlinear Systems under Input Constraints
3.1 RBF Neural Network
3.2 Design SMC Controller for Ship Autopilot
3.3 Stability Analysis
4 Simulation Results
4.1 Course-Keep Simulation
4.2 Course-Change Simulation
5 Conclusion
References
Automatic Assessment Model for Sailing in Narrow Channel
1 Introduction
2 Evaluation Method
3 Evaluation Index System
3.1 Display of Lights and Shapes
3.2 Risk of Collision
3.3 Responsibility
3.4 Anti-collision Way
3.5 Anti-collision Range
3.6 Lookout
3.7 Re-action Time
3.8 Safe Speed
3.9 Action Horn
3.10 Distance to Channel
3.11 Cross Channel
3.12 Action Time
3.13 Anti-collision Result
4 Evaluation Model
5 Examples
6 Conclusions
References
Bus Arrival Time Prediction and Release: System, Database and Android Application Design*
1 Introduction
2 System Overall Architecture
3 Server
3.1 Logical Structure
3.2 Design and Implementation
4 Database
4.1 Composition of Database
4.2 Database Design
5 Client
5.1 Software Structure
5.2 Function Implementation
6 System Experiment
6.1 Texting Result
6.2 Result Analysis
7 Conclusion
References
On Key Techniques of a Radar Remote Telemetry and Monitoring System*
1 Introduction
2 System Architecture
3 Embedded Hardware Designed for Remote Telemetry Radar
4 A Target Echo Identifying Algorithm
5 The Applied Case
6 Conclusions
References
PSC Ship-Selecting Model Based on Improved Particle Swarm Optimization and BP Neural Network Algorit
1 Introduction
2 Adaptive Swarm Algorithm
2.1 Standard Algorithm and Former Improved Algorithm
2.2 Improved Adaptive Swarm Algorithm
3 PSC Ship-Selecting Model Based on Improved Swarm Optimization-BP Neural Network Algorithm
3.1 BP Neural Network Evaluation Model
3.2 Training and Learning Process Ship-Selecting Analysis
3.3 Selecting Results Analysis
4 Conclusion
References
LRPON Based Infrastructure Layout Planning of Backbone Networks for Mobile Cloud Services in Transpo
1 Introduction
2 Related Work
3 Problem Statement
4 Proposed Fast-Backward-Searching (FBS) Algorithm
5 Numerical Results
6 Conclusions
References
Infrastructure Deployment and Dimensioning of Relayed-Based Heterogeneous Wireless Access Networks f
1 Introduction
2 Related Work
3 Problem Formulation
3.1 Network Model
3.2 Problem Statement
3.3 Problem Formulation
4 Numerical Analysis
4.1 Simulation Settings
4.2 Validation of the ILP Formulation
4.3 Feasibility and Scalability of IDD Formulation
5 Conclusion

People also search for Algorithms and Architectures for Parallel Processing 14th International Conference ICA3PP 2014 Dalian China August 24 27 2014 Proceedings Part II 1st:

what is parallel algorithm
 
algorithms parallel and sequential
 
parallel processing algorithms
 
algorithms that can be parallelized
 
parallel programming algorithms

Tags: Algorithms, Architectures, Parallel Processing, Conference, Dalian China, Xian He Sun, Wenyu Qu, Ivan Stojmenovic, Wanlei Zhou, Zhiyang Li, Hua Guo, Geyong Min, Tingting Yang, Yulei Wu, Lei Liu