Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

33 articles for “dynamic allocation”

Set a search alert
Research ArticleOpen accessIn the abstractA Dynamic Object Fragmentation and Replication Algorithm In Distributed Database SystemsAzzam Sleit, Wesam AlMobaideen, Samih Al-Areqi, Abdulaziz YahyaThis paper proposes an enhancement for the ADRW algorithm to achieve dynamic fragmentation and object allocation in distributed databases. The algorithm adapts to the changing patterns of object requests with the objective to dynamically adjust the allocation schemes of objects in order to minimize the total servicing cost of all requests. Objects may be replicated or fragmented depending on patterns … …American Journal of Applied Sciences, Vol. 4, Issue 8 · 31 Aug 2007 · 7,384 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordCost Effective Expa-Max-Min Scientific Workflow Allocation and Load Balancing Strategy in Cloud ComputingJames Kok Konjaang, Fahrul Hakim Ayob, Abdullah MuhammedThe rise in demand for cloud resources (network, hardware and software) requires cost effective scientific workflow scheduling algorithm to reduce cost and balance load of all jobs evenly for a better system throughput. Getting multiple scientific workflows scheduled with a reduced makespan and cost in a dynamic cloud computing environment is an attractive research area which needs more attention. Scheduling … …Journal of Computer Science, Vol. 14, Issue 5 · 13 Jan 2018 · 8,585 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordEFFECTIVE HEURISTIC ALGORITHM FOR DYNAMIC ROUTING AND BANDWIDTH MANAGEMENT UNDER QUALITY OF SERVICE CONSTRAINTS IN MULTISTAGE INTERCONNECTION NETWORKSR. Deepalakshmi, S. RajaramToday, Internet of Things (IoT) has introduced abundant bandwidth consumption and necessities in multimedia communications from online games to video-conferencing applications with the constraint of QoS requirements from time to time. The expected rapid proliferation of services would require performance unprecedented in the currently available best-effort routing algorithms. In, particular, the present routing mechanisms are based on the best-effort paradigm … …American Journal of Applied Sciences, Vol. 11, Issue 3 · 7 Jan 2014 · 7,138 accessesView PDFCite