A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A Cloud-Computing-Based Data Placement Strategy in High-Speed Railway
2012
Discrete Dynamics in Nature and Society
Preserved Fulltext
A hierarchical data placement strategy is proposed for large-scale networks. ...
The semi-definite programming algorithm is suitable for the placement of files with various replications, ensuring that different replications of a file are placed on different storage devices, while the ...
Thus, a 2 Discrete Dynamics in Nature and Society distributed storage service of cloud computing has to take large-scale storage mechanism for various data types into account, as well as the performance ...
doi:10.1155/2012/396387
fatcat:uqa2a3miybftdbzoxft4bytcwy
Author index
2013
2013 IEEE International Conference on Cluster Computing (CLUSTER)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Solutions in Large-scale Storage Systems Integrating Deadline-Modification SCAN Algorithm to Xen-based Cloud Platform EDR: An Energy-Aware Runtime Load Distribution System for Data-Intensive Applications ...
High-Performance and Cost-Effective Distributed Storage Systems with Information Dispersal Algorithms Devine, Neal K. ...
doi:10.1109/cluster.2013.6702604
fatcat:cxctjrwnfjahhosdn7afzf6dla
Optimal Data File Allocation for All-to-All Comparison in Distributed System: A Case Study on Genetic Sequence Comparison
2019
International Journal of Computers Communications & Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
For this purpose, the author formally described the all-to-all comparison problem, and con-structed a data allocation model via mixed integer linear programming (MILP). ...
In order to solve the problem of unbalanced load of data les in large-scale data all-to-all comparison under distributed system environment, the differences of les themselves arefully considered. ...
BJ09-44 and the Inner Mongolia Autonomous Region Key Laboratory of big data research and application for agriculture and animal husbandry.
Author contributions. ...
doi:10.15837/ijccc.2019.2.3526
fatcat:dpl2fowrbja3fbtd5sgu5dwviu
A Survey On Data-Centric And Data-Aware Techniques For Large Scale Infrastructures
2016
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this survey we analyse the different mechanisms that have been proposed to provide data locality for large scale high-performance and high-throughput systems. ...
Large scale computing infrastructures have been widely developed with the core objective of providing a suitable platform for high-performance and high-throughput computing. ...
Scheduling in large-scale systems is a wide concept: it faces the allocation of a set of tasks to multiple processors and the establishment of execution order [21] . ...
doi:10.5281/zenodo.1112257
fatcat:4l7qjgwdcrffddnwgb4dd3miuu
ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
2010
BMC Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To solve the conventional memory-dependency problem, ClustalXeed uses both physical random access memory (RAM) and a distributed file-allocation system for distance matrix construction and pairalign computation ...
There is an increasing demand to assemble and align large-scale biological sequence data sets. ...
This work was supported by the Korea Institute of Energy Technology Evaluation and Planning R&D program (2009), under the Korea Ministry of Knowledge Economy (MKE). ...
doi:10.1186/1471-2105-11-467
pmid:20849574
pmcid:PMC2949895
fatcat:juubctfrcrftxgelheo7iuas2y
Load Rebalancing for Distributed File Systems in Clouds
2013
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Based on this architecture, to present the vision, open research challenges and resource provisioning and allocation algorithms for energy-efficient management of cloud computing environments. ...
We Introduce MILP(Mixed Integer Linear Programming) for joint optimization of over all network processing cost. ...
In this paper, we are interested in studying the load rebalancing problem in distributed file systems specialized for large-scale, dynamic and data-intensive clouds. ...
doi:10.1109/tpds.2012.196
fatcat:fpvqjgd6tbbd7l4p5akxwdcw3y
Multi Scheduling Reactive Resource Sharing for Dynamic Dataflow in Cloud Environment
2016
Bonfring International Journal of Data Mining
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Major Cloud computing companies have started to integrate frameworks for parallel data processing in their product portfolio making it easy for customers to access these services and to deploy their programs ...
Thus, for reduction in energy consumption, the proposed work address the challenge by effectively distributing compute-intensive parallel applications on cloud. ...
Key enabling technologies for clouds include the Map Reduce programming paradigm distributed file systems virtualization and so forth. ...
doi:10.9756/bijdm.8307
fatcat:rxw5tqleircvvdg5teoqc6d5z4
Author index
2014
2014 IEEE International Conference on Cluster Computing (CLUSTER)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Using Dynamic Monitoring and Task Mapping Di, Sheng GIRAFFE: A Scalable Distributed Coordination Service for Large-scale Systems Dimarco, Jeffrey Applying Frequency Analysis Techniques to DAG-based Workflows ...
Strategies Huard, Guillaume A Spatio temporal Data Aggregation Technique for Performance Analysis of Large-scale Execution Traces Rucci, Enzo Smith-Waterman Algorithm on Heterogeneous System: A Case Study ...
doi:10.1109/cluster.2014.6968663
fatcat:cgfz2ihyufauljzrlt75me7y3e
Page 7217 of Mathematical Reviews Vol. , Issue 92m
[page]
1992
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
G. (1-BELL) Computational results of an interior point algorithm for large scale linear programming.
Interior point methods for linear programming: theory and practice (Scheveningen, 1990).
Math. ...
Summary: “Optimal routing is an important subclass of resource allocation and load balancing problems that has applications in file allocation, distributed database systems, local area networks, etc. ...
Survey on Load Rebalancing For Distributed File Systems in Clouds
2014
IOSR Journal of Computer Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Distributed file systems are key building blocks for cloud computing applications based on the Map Reduce programming paradigm. ...
This results in load imbalance in a distributed file system; that is, the file chunks are not distributed uniformly as possible among the nodes. ...
., the distributions of file chunks in a large scale storage system) in the public domain, we have investigated the performance of the proposal and compared it against competing algorithms through synthesized ...
doi:10.9790/0661-16238186
fatcat:rlm2jfseizdubjm2p2fssevfga
Design and Implementation of Parallelization of BLAST Algorithm Based on Spark
2018
DEStech Transactions on Computer Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The method uses Spark memory computation to identify and divide tasks, and realizes the distributed parallel computing of the BLAST algorithm. ...
It can reduce the running time of program while maintaining high precision, but it has performance bottleneck and low efficiency when comparing large gene data sets. ...
And it is necessary to upload sequence alignment files to the HDFS distributed file system for parallel computing. ...
doi:10.12783/dtcse/iece2018/26643
fatcat:axf4f63hpbg7hl2qublv3h733y
NFU-Enabled FASTA: moving bioinformatics applications onto wide area networks
2007
Source Code for Biology and Medicine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Results: For large datasets, computation-enabled logistical networks provide a significant reduction in FASTA algorithm running time over local and non-distributed logistical networking frameworks. ...
Here, we demonstrate software that enables this approach by distributing both the FASTA algorithm and appropriate data sets within the framework of a wide area network. ...
Acknowledgements The authors would like to acknowledge the Baylor University Research Council for financial support and the tremendous technical expertise and resources of the Logistical Computing and ...
doi:10.1186/1751-0473-2-8
pmid:18039379
pmcid:PMC2211279
fatcat:jqvmd554obhahbedvfex757luu
A distributed computing framework for All-to-All comparison problems
2014
IECON 2014 - 40th Annual Conference of the IEEE Industrial Electronics Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
While distributed computing systems can provide the ability to solve large scale applications in general, new techniques need to be developed to improve the performance for storage and processing of big ...
In addition, comprehensive experiments of the computing framework will be conducted on large-scale distributed computing systems. Fig. 1 . 1 The growth trend of solution space for S(Q, 2). ...
doi:10.1109/iecon.2014.7048857
dblp:conf/iecon/ZhangTKF14
fatcat:ueov7zg5xbcmbkwnu3dhvmuz74
FlexIO: I/O Middleware for Location-Flexible Scientific Data Analytics
2013
2013 IEEE 27th International Symposium on Parallel and Distributed Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Experimental results demonstrate that FlexIO can support a variety of simulation and analytics workloads at large scale through flexible placement options, efficient data movement, and dynamic deployment ...
Since different placements have different impact on performance and cost, there is a consequent need for flexibility in the location of data analytics. ...
Department of Energy, and Center for Exascale Simulation of Combustion in Turbulence (ExaCT), U.S. Department of Energy. ...
doi:10.1109/ipdps.2013.46
dblp:conf/ipps/ZhengZESWDNCAKPY13
fatcat:uogj5f6yvfhbtcmvccrqjybhoe
Recourses Utilization in a Distributed System: A Review
2021
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Recourses in a distributed system can be accessed or remotely accessed across multiple nodes in the system. Nodes share resources including hardware, software, and data in distributed systems. ...
Therefore, this paper focuses on resource utilization in different techniques and different domains that motivate and support a distributed system. ...
It needs a system that requires large amounts of resources to be allocated for analysis of Visual data on a large scale. ...
doi:10.5281/zenodo.4461812
fatcat:doy7mxlqnbf6nec7kgvayjzxpu
« Previous
Showing results 1 — 15 out of 64,569 results