26,996 Hits in 5.0 sec

A Cloud-Computing-Based Data Placement Strategy in High-Speed Railway

Hanning Wang, Weixiang Xu, Futian Wang, Chaolong Jia
2012 Discrete Dynamics in Nature and Society  
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  ...  dynamic interval mapping algorithm ensures better self-adaptability of the data storage system.  ...  Compared to the consistent hashing, this algorithm exchanges the time for space. It is not suitable for a storage system that has a demanding requirement for rapid data search.  ... 
doi:10.1155/2012/396387 fatcat:uqa2a3miybftdbzoxft4bytcwy

Combining Static and Dynamic Storage Management for Data Intensive Scientific Workflows

Nicholas Hazekamp, Nathaniel Kremer-Herman, Benjamin Tovar, Haiyan Meng, Olivia Choudhury, Scott Emrich, Douglas Thain
2018 IEEE Transactions on Parallel and Distributed Systems  
storage consumption of individual tasks, enabling the strong guarantees of the static analysis and dynamic management algorithms.  ...  prediction of success or failure. (2) An online storage management algorithm which accounts for the storage needed by future tasks to avoid deadlock at runtime. (3) A task containment system which limits  ...  Dynamic Storage Algorithm The dynamic algorithm consists of three stages for each node's execution: verification, allocation, and release.  ... 
doi:10.1109/tpds.2017.2764897 fatcat:vkh6ntbbejer7o252hojyzpg44

A Survey on Determining the Characteristics of Deadlock, Scheduling and Workflow Instances and Providing New Algorithms for the Issues Arising in Hybrid Cloud

B. Arunkumar, T.Ravichandran T.Ravichandran
2015 International Journal of Computer Applications  
On the other hand, since the amount of storage is limited on most systems, deadlock due to numerous storage requests would-be a problem.  ...  Effective scheduling is a key concern for the execution of performance driven cloud applications.  ...  Third, select the suitable processor for a node .It suitable for a wide range of graph structures [6] , [9] .  ... 
doi:10.5120/19386-0883 fatcat:lbhzzgqh6rcndo6gxbortrhl6a

Assignment Algorithm of Computer Storage Management Partition and Its Implementation

Simin Mu
2018 Computer Software and Media Applications  
Then, a detailed analysis of the operating system primary storage allocation of a simple algorithm and one of its implementation., which mainly is to achieve a variable partition of the storage management  ...  The entire storage management partition allocation algorithm and its implementation is entirely in accordance with the primary storage management of the operating system and effective use, in order to  ...  The file system stores the information in a named object called a file for long-term storage.  ... 
doi:10.24294/csma.v1i1.266 fatcat:qn6wrzsd6zfxfcz6cuohljvtzm

A Survey for Replica Placement Techniques in Data Grid Environment

Alireza Souri, Amir masoud Rahmani
2014 International Journal of Modern Education and Computer Science  
Also, in data replication, there are some challenges to finding the best replica efficiently in relation to performance and location of physical storage systems.  ...  These strategies measure and analyze different parameters such as access cost, bandwidth consumption, scalability, execution time and storage consumption.  ...  4) storage cost for file F at node N.  ... 
doi:10.5815/ijmecs.2014.05.06 fatcat:iafsb4xfsrhubls33mqmxtvmju

Symphony: an integrated multimedia file system

Prashant J. Shenoy, Pawan Goyal, Sriram S. Rao, Harrick M. Vin, Kevin Jeffay, Dilip D. Kandlur, Timothy Roscoe
1997 Multimedia Computing and Networking 1998  
specific structure to files.  ...  Some of the novel features of Symphony include: a QoS-aware disk scheduling algorithm; support for data type specific placement, failure recovery, and caching policies; and support for assigning data type  ...  We thank Mike Dahlin and Renu Tewari for their comments on earlier drafts of the paper.  ... 
doi:10.1117/12.298415 fatcat:gtuv6yq7vja3nczjsu6iju27ee

TOSDS: Tenant-centric Object-based Software Defined Storage for Multitenant SaaS Applications

Aditi Sharma, Parmeet Kaur
2021 Arabian Journal for Science and Engineering  
The paper proposes a tenant-centric approach to develop an object-based software defined storage system for SaaS multi-tenant applications.  ...  We present TOSDS (Tenant-centric Object-based Software Defined Storage), a system that can efficiently meet the storage requirements of users or tenants with diverse needs who are using a multitenant SaaS  ...  Authors have introduced a Hierarchical Bin Packing algorithm for dynamic allocation of tenant data load over the available storage space.  ... 
doi:10.1007/s13369-021-05743-z pmid:34155470 pmcid:PMC8208615 fatcat:2eugefb6jnfrtn6fffqppybj3y

Enhancing throughput of the Hadoop Distributed File System for interaction-intensive tasks

Xiayu Hua, Hao Wu, Zheng Li, Shangping Ren
2014 Journal of Parallel and Distributed Computing  
Experiments have shown that with the proposed architecture together with the associated storage allocation algorithm, the HDFS throughput for interaction-intensive files increases 300% on average with  ...  As a result, this system is suitable for applications that have large I/O data sets.  ...  Acknowledgments The authors wish to thank Professor Bin Su, the dean of software engineer department of Southwest Jiaotong University, China, for his help in providing the infrastructure for the experiments  ... 
doi:10.1016/j.jpdc.2014.03.010 fatcat:dt2u3ihi6jgy5er2nq52iaz5wm

A Framework for Power of 2 Based Scalable Data Storage in Object-Based File System

Ohnmar Aung, Nilar Thein
2013 International Journal of Future Computer and Communication  
B+ tree-based indexing algorithm is widely being popular for managing data dynamically in today's storage systems.  ...  Index Terms-B+ tree, power of 2-based clustering Ohnmar Aung is now making research related with object-based file system. She is also a phd student as well as a staff of  ...  Since B+ tree is self-balanced structure, which is suitable to weight-based object allocation for the proposed system.  ... 
doi:10.7763/ijfcc.2013.v2.216 fatcat:yhcrfbjzundz5bi6g6igi7rzhi

Secure Dynamic Groups Data Sharing with Modified Revocable Attribute-Based Encryption in Cloud

2019 International journal of recent technology and engineering  
better security in dynamic cloud users with multiple authorities, but they still face challenges, either lack of performance or rely on a trusted server, and are not suitable for distribution with the  ...  Cloud computing provides a flexible and convenient way for data sharing, which brings various benefits for both the society and individuals.  ...  We understand that stats owners cannot rely entirely on servers in the cloud, so technologies to eliminate traditional features are not now suitable for cloud storage structures [5] .  ... 
doi:10.35940/ijrte.d9788.118419 fatcat:jjsbgentz5e45mnuezzehvx3mq

A Survey on Storage Techniques in Cloud Computing

Samson Akintoye, Antoine Bagula, Yacine Djemaiel, Noureddine Bouriga
2017 International Journal of Computer Applications  
Cloud computing is a computing paradigm, where a large pool of systems are connected in private, public or hybrid networks, to provide dynamically scalable infrastructure for computing resources.  ...  This paper provides a survey of some proposed cloud storage methods and techniques, their advantages and drawbacks and makes stress on the current requirements for storage techniques in cloud computing  ...  The indices are distributed across different storage nodes and experiments were carried out to select a suitable index structure to organize the chunk entries for their quick retrieval.  ... 
doi:10.5120/ijca2017913472 fatcat:joak5sjqajfqzg74xq5hzivyee

Optimal file allocation in multi-level storage systems

Peter P. S. Chen
1973 Proceedings of the June 4-8, 1973, national computer conference and exposition on - AFIPS '73  
Since each type of storage has a different cost/performance ratio, a series of important problems arise in the design and use of multi-level storage systems-for example, ho\v to allocate files within a  ...  The last onp is to allocate files minimizing the total storage cost and satisfying an individual response time requirement for each file.  ...  Bradley for their comments.  ... 
doi:10.1145/1499586.1499662 dblp:conf/afips/Chen73 fatcat:ufioaha74naejny3l2xxd2kyaa

CloudSimNFV: Modeling and Simulation of Energy-Efficient NFV in Cloud Data Centers [article]

Wutong Yang, Minxian Xu, Guozhong Li, Wenhong Tian
2015 arXiv   pre-print
proposing several scheduling algorithm based on for NFV applications.  ...  To speed up NFV related research, we need a user friendly and easy to use research tool, which could support data center simulation, scheduling algorithms implementation and extension, and provide energy  ...  NFV algorithm: The NFV algorithm also adopts a probabilistic function to select the most suitable PM to allocate VM.  ... 
arXiv:1509.05875v1 fatcat:t4vf2dogzjcd7ldxloakd7atra

Design considerations for the symphony integrated multimedia file system

Prashant Shenoy, Pawan Goyal, Sriram Rao, Harrick M. Vin
2003 Multimedia Systems  
We examine the design requirements for such file systems and argue that, to efficiently manage the heterogeneity in application requirements and data characteristics, a multimedia file system should enable  ...  We first discuss various methodologies for designing multimedia file systems and examine their tradeoffs.  ...  Such a file structure is general and encompasses files produced by most commonly used compression algorithms.  ... 
doi:10.1007/s00530-003-0104-5 fatcat:s3k4kr5r5vgtxizqrpwqghufxu

Construction of a Multimedia-Based University Ideological and Political Big Data Cloud Service Teaching Resource Sharing Model

Jian Feng, Weiliang Zhang, Sang-Bing Tsai, Xiangtao Li
2021 Mathematical Problems in Engineering  
Specifically, according to the characteristics of the educational resource grid, the key factors affecting the performance of copy creation strategy are analysed, and a dynamic copy creation strategy is  ...  The proposed resource allocation mechanism has achieved good results in ensuring the fair distribution of resources and ensuring high resource utilization when resource sharing users put forward multiple  ...  resource scheduling algorithm, a dynamic multiresource fair allocation algorithm in which users submit multiple sets of limited time-varying task requirements.  ... 
doi:10.1155/2021/9907630 fatcat:iyaeyqzvjrg5ne6wd6rmzmkdom
« Previous Showing results 1 — 15 out of 26,996 results