To gain higher performance under many constraints, effective scheduling is a key concern in data-intensive grid computing. Based on a Dual-Component and Dual-Queue Distributed Schedule Model (DCDQDSM), we present task...
详细信息
This is the age of information. Now-a-days everyone communicates with each other by means of digital systems. Humans are always communicating with each other on the go. On-demand broadcasting is an efficient way to br...
详细信息
This is the age of information. Now-a-days everyone communicates with each other by means of digital systems. Humans are always communicating with each other on the go. On-demand broadcasting is an efficient way to broadcast information according to user requests. In an on-demand broadcasting network, anyone can satisfy multiple clients in one broadcast which helps to fulfill the enormous demand of information by clients. The optimized flow of digital data in a network through the transmission of digital evidence about messages is called network coding. The "digital evidence" is composed of two or more messages. Network coding incorporated with data scheduling algorithms can further improve the performance of on-demand broadcasting networks. Using network coding, anyone can broadcast multiple data items using single broadcast strategy which can satisfy the needs of more clients. In this work, it is described that network coding cannot always maintain its superiority over non-network coding when the system handles different sized data items. However, the causes of performance reduction on network coding have been analyzed and THETA based dynamic threshold value integration strategy has been proposed through which the network coding can overcome its limitation for handling heterogeneous data items. In the proposed strategy, THETA based dynamic threshold will control which data item will be selected from the Client Relationship graph (CR-graph) so that large sized data items cannot be encoded with small sized data items. Simulation result shows some interesting performance comparison.
In this paper, two improved recursive maximum expansion scheduling algorithms for LTE uplink SCFDMA are proposed. The proposed Improved Recursive Maximum Expansion (IRME) scheme can achieve higher degree of freedom in...
详细信息
With development of digital multimedia, many applications, such as VoD, remote education, and so on, becomes a reality. Multimedia resource in education system becomes very rich. With the increasing number of multimed...
详细信息
作者：
Roy, ArghyadipBiswas, NilanjanIit
Mehta Family School of Data Science and Artificial Intelligence Assam Guwahati781039 India Nit
Ece Department West Bengal Durgapur713209 India
With the advent of Mobile Edge Computing (MEC), the arriving tasks in an Internet of Things (IoT) network can be executed locally or at an MEC server. A Constrained Markov Decision Process (CMDP) formulation can captu...
详细信息
The increasing demand for higher data rates on the internet requires routers that deliver high performance for high-speed connections. Nowadays high speed routers use the buffered crossbar switches, which have been th...
详细信息
In order to support different types of multimedia applications, the IEEE 802.16 standard defines different service classes with their associated Quality of Service (QoS) parameters. The scheduling algorithm is the cru...
详细信息
In multiprogramming computer systems, the scheduling strategy used to select tasks to be activated is an important factor in the achievement of the performance goals of the system. One form of analysm of scheduling al...
详细信息
The problem of fmdlng those optimum scheduling algorithms for time-shared systems that mlmmize a cost function that depends on waiting time and required service time IS considered An optimality condmon which sometimes...
详细信息
This study examined the developments in the field of scheduling algorithms in the last 30 years (1992-2021) to help researchers gain new insight and uncover the emerging areas of growth for further research in this fi...
详细信息
This study examined the developments in the field of scheduling algorithms in the last 30 years (1992-2021) to help researchers gain new insight and uncover the emerging areas of growth for further research in this field. This study, therefore, carried out a bibliometric analysis of 12,644 peer-reviewed documents extracted from the Scopus database using the Bibliometrix R package for bibliometric analysis via the Biblioshiny web interface. The results of this study established the development status of the field of scheduling algorithms, the growth rate, and emerging thematic areas for further research, institutions, and country collaborations. It also identified the most impactful and leading authors, keywords, sources, and publications in this field. These findings can help both budding and established researchers to find new research focus and collaboration opportunities and make informed decisions as they research the field of scheduling algorithms and their applications.
暂无评论