Using parallelization techniques to solve the one-to-one shortest path problem
碩士 === 淡江大學 === 資訊管理學系碩士班 === 101 === In recent years as more mobile devices allow user to get online more easily, there is increasing demand for more powerful cloud services to serve more requests with shorter response time. In the past, the server often uses CPU to handle the requests. As the CPU...
Main Authors: | Yung-Hsin Ho, 何永欣 |
---|---|
Other Authors: | Shih-Chieh Wei |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/81474601782401380327 |
Similar Items
-
Split Demand One-to-One Pickup and Delivery Problems With the Shortest-Path Transport Along Real-Life Paths
by: Jian Xiong, et al.
Published: (2020-01-01) -
An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph
by: Vianney Kengne Tchendji, et al.
Published: (2019-06-01) -
Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths.
by: Xin Qi, et al.
Published: (2020-01-01) -
Solving the Network Shortest Path Problem on a Quantum Annealer
by: Thomas Krauss, et al.
Published: (2020-01-01) -
The Study on Constructing One-to-One Shortest Path Searching System under Multithreading Technology
by: Tsung-Ping Yang, et al.
Published: (2006)