Minimizing the Data Transfer Time Using Multicore End-System Aware Flow Bifurcation

2012 ◽  
Author(s):  
Vishal Ahuja ◽  
Dipak Ghosal ◽  
Matthew Farrens
Keyword(s):  
Data Transfer ◽  
Transfer Time ◽  
Flow Bifurcation

Abstract TMP73: Intra-arterial Transfer Time Metrics Study—Southern California Kaiser Permanente and University of Texas Houston Telestroke Network Experience

Stroke ◽  
2017 ◽  
Vol 48 (suppl_1) ◽  
Author(s):  
Tzu-Ching Wu ◽  
Navdeep Sangha ◽  
Feryal N Elorr ◽  
Edgar Olivas ◽  
Christy M Ankrom ◽  
...  
Keyword(s):  
Health Systems ◽  
Best Practice ◽  
Data Transfer ◽  
Symptom Improvement ◽  
Transfer Time ◽  
Kaiser Permanente ◽  
University Of Texas ◽  
Integrated Health Care System ◽  
A Prospective Study ◽  
Practice Time

Background: The transfer process for patients with large vessel occlusions from a community hospital to an intra-arterial therapy (IAT)-capable center often involves multiple teams of physicians and administrative personnel, leading to delays in care. Objective We compared time metrics for spoke drip-and-ship telemedicine (TM) patients transferred for IAT to comprehensive stroke centers (CSC) in two different health systems: Kaiser Permanente (KP) with an integrated health care system of spokes and a 50 mile range using ambulances for transfer vs UTHealth (UTH), where patients are transferred by helicopter from varying health systems ranging up to 200 miles from the hub. Methods: We retrospectively identified patients in the KP and UTH networks transferred from TM spokes to the CSC (KP—6 spokes and UTH -17 spokes). From 9/15 to 4/16, a total of 79 TM patients (KP-28 patients, UTH-51 patients) were transferred to the respective hubs for evaluation of IAT. Baseline clinical data, transfer, and IAT metrics were abstracted. Results: On average, it takes ~90 minutes for a TM patient to arrive at the CSC hub once accepted by the transfer center. Patients in the KP Network arrive at the hub faster than UTH patients, but IAT metrics/outcomes are comparable. Over 50% of the patients did not undergo IAT on hub arrival mostly due to lack of clot on CTA (20/45) or symptom improvement (9/45). Conclusion: In two large, yet different TM networks, the transfer time from spoke to hub needs to be shortened. Areas for improvement include spoke arrival to transfer acceptance and transfer acceptance to hub arrival. A prospective study is underway to develop best practice time parameters for this complex process of identifying and transferring patients eligible for IAT.

Pareto frontier for job execution and data transfer time in hybrid clouds

2014 ◽  
Vol 37 ◽  
pp. 321-334 ◽  
Author(s):  
Javid Taheri ◽  
Albert Y. Zomaya ◽  
Howard Jay Siegel ◽  
Zahir Tari
Keyword(s):  
Data Transfer ◽  
Pareto Frontier ◽  
Transfer Time ◽  
Hybrid Clouds

scholarly journals Implementasi Algoritma Kompresi Data Huffman Untuk Memperkecil Ukuran File MP3 Player

2011 ◽  
Vol 2 (1) ◽  
Author(s):  
Victor Amrizal
Keyword(s):  
Frequency Distribution ◽  
Data Transfer ◽  
Huffman Coding ◽  
Original Text ◽  
Text Compression ◽  
Huffman Code ◽  
Code Length ◽  
Transfer Time ◽  
Compression Process ◽  
Mp3 Player

Process to minimize file is by undertaking compression to that file. Text compression process aims to reduce symbol purpose repeat or character that arrange text by mengkodekan symbols or that character so room the need storage can be reduced and data Transfer time can faster. Text compression process can be done by mengkodekan segments of original text is next to be placed deep lexical. Process compression can be done by various algorithm media, amongst those Coding's Huffman that constitutes one of tech compression which involve frequency distribution a symbol to form unique code. Symbol frequency distribution will regard long its Huffman code, progressively frequent that symbol texts deep appearance therefore Huffman code length that resulting will get short. This method mengkodekan symbols or characters with binary treed help by merges two character emergence frequencies smallest until molded treed codes.   Keywords:. Huffman Coding, kompresi data, algoritma.

Comparison of analytical and ML-based models for predicting CPU–GPU data transfer time

Computing ◽  
2020 ◽  
Vol 102 (9) ◽  
pp. 2099-2116
Author(s):  
Ali Riahi ◽  
Abdorreza Savadi ◽  
Mahmoud Naghibzadeh
Keyword(s):  
Data Transfer ◽  
Transfer Time

scholarly journals Evaluating the Impact of Data Transfer Time in Contact-Based Messaging Applications

2015 ◽  
Vol 19 (10) ◽  
pp. 1814-1817 ◽  
Author(s):  
Enrique Hernandez-Orallo ◽  
Jorge Herrera-Tapia ◽  
Juan-Carlos Cano ◽  
Carlos T. Calafate ◽  
Pietro Manzoni
Keyword(s):  
Data Transfer ◽  
Transfer Time ◽  
The Impact

AN INTERCONNECT ALLOCATION ALGORITHM FOR PERFORMANCE-DRIVEN DATAPATH SYNTHESIS

1996 ◽  
Vol 06 (04) ◽  
pp. 403-423
Author(s):  
YOUNG-NO KIM ◽  
HAE DONG LEE ◽  
SUN YOUNG HWANG
Keyword(s):  
Load Balancing ◽  
Data Transfer ◽  
Critical Path ◽  
Experimental Results ◽  
Transfer Time ◽  
Clock Period ◽  
Allocation Algorithm ◽  
Critical Paths ◽  
Communication Lines ◽  
A Performance

This paper presents the design of a performance-driven interconnect allocation algorithm. The proposed algorithm is based on the idea that the data transfer time can be reduced by balancing the load for specific hardware modules on possible critical path, such that the clock period can be minimized. By performing load balancing for only the communication lines on critical paths, the proposed algorithm generates interconnection structures with minimum delays. Experimental results confirm the effectiveness of the algorithm by constructing the interconnection structures with minimized clock periods for several benchmark circuits available from the literature.

Telecardiology: Results and perspectives of an operative experience

2000 ◽  
Vol 6 (1_suppl) ◽  
pp. 162-164 ◽  
Author(s):  
Roberto Fogliardi ◽  
Enrico Frumento ◽  
David Rincón ◽  
Miguel ángel Viñas ◽  
Mario Fregonara
Keyword(s):  
Expert Opinion ◽  
Traditional Method ◽  
Data Transfer ◽  
Transfer Time ◽  
Single Patient ◽  
Specialist Care ◽  
Operative Experience

A telecardiology system has been established between six Italian hospitals. Four of them are connected using three ISDN lines; the remaining two are connected with only a single ISDN line. The telecardiology system was evaluated between two hospitals. Radiographs showing the heart movements of 10 patients were digitized and forwarded to the specialist hospital for expert opinion. The transfer time of a single patient sequence ranged from 6 h 40 min to 22 h 15 min using a single ISDN line at 128 kbit/s. The transfer time decreased considerably using three ISDN lines. Following data transfer, a joint consultation was organized between the cardiologists in realtime. Realtime telecardiology using three ISDN lines was clinically viable and more efficient than the traditional method of delivering this type of specialist care.

scholarly journals Promote Replica Management based on Data Mining Techniques

2018 ◽  
Vol 7 (4.19) ◽  
pp. 838
Author(s):  
Rafah M. Almuttairi ◽  
Mahdi S. Almhanna ◽  
Mohammed Q. Mohammed ◽  
Saif Q Muhamed
Keyword(s):  
Data Mining ◽  
Data Transfer ◽  
Search Algorithm ◽  
Data Access ◽  
Transfer Time ◽  
Transmission Data ◽  
Replica Management ◽  
Grid Technique ◽  
The Common ◽  
Considerable Benefit

The data grid technique evolved largely in sharing the data in multiple geographical stations across different sites to improve the data access and increases the speed of transmission  data. The performance and the availability of the resources is taken into account, when a total of sites holding a copy of files, there is a considerable benefit in selecting the best set of replica sites to be cooperated for increasing data transfer job. In this paper, new selecrtion strategy is proposed to reduce the total transfer time of required files. Pincer-Search algorithm is used to explore the common characteristics of sites to select uncongested  replica sites.  

Sign in / Sign up

Export Citation Format

Share Document