The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
With the development of digital technology, gird technology is rapidly developing. Grid computing, as a key technology for the next generation Internet, becomes one of the hot areas of current research at domestic and international. Resource management and scheduling algorithm are the two fundamental problems in grid computing. Firstly, the conception of gird is introduced and grid resource algorithm...
In the application of target tracking based on dynamic convey tree-based collaboration (DCTC) in wireless sensor networks, collisions and interferences among nodes pose a challenge for data aggregation. In this paper, we refine slot allocation to the nodes in dynamic convey tree and design an energy efficient MAC protocol called D-TDMA, which avoids collisions and interferences and allocates contiguous...
This study considers the uniform parallel machine scheduling problem with tails to minimize the maximal completion time. In this scheduling problem, all the machines are intelligent industrial robots and hence agent technology is introduced to realize the intelligence of the robots. The scheduling problem is described and analyzed and then an agent-based heuristic algorithm ABHA is presented, in which...
In real-time database system, the same data through the read and write operations, the implementation of concurrent real-time transaction could undermine the consistency of the database. Concurrency control algorithm must be used to ensure serializability of transaction scheduling, and real-time database system to maintain data consistency. In light of the traditional real-time database concurrency...
This paper considers the multi-processor scheduling problem with unequal release dates to minimize total completion times. This problem is proved to be NP-hard in the strong sense. Traditional forward algorithms base on the heuristic rule SPT (shortest processing time first) and ERD (earliest release date first) for the problem are analyzed. A backward algorithm BA is proposed to avoid the limitation...
This paper considers the problem of uniform parallel machine scheduling with unequal release dates so as to minimize makespan. This problem is proved to an NP-hard problem. Heuristics in existence for the problem are analyzed, and then we present an improved algorithm. The performance of the algorithms by experiment is also analyzed. The heuristic is further extended by applying the method of variable...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.