We study the problem of scheduling periodic-time-critical tasks on multiprocessor computing systems. A periodic-time-critical task consists of an infinite number of requests, each of which has a prescribed deadline. The scheduling problem is to specify an order in which the requests of a set of tasks are to be executed and the processor to be used, with the goal of meeting all the deadlines with a minimum number of processors. Since the problem of determining the minimum number of processors is difficult, we consider two heuristic algorithms. These are easy to implement and yield a number of processors that is reasonably close to the minimum number. We also analyze the worst-case behavior of these heuristics.
India, in the Computer Science and Engineering Department. He obtained a bachelor's degree, a master's of engineering (CSE), and a PhD (CSE) from SGBAU Amravati University, Maharashtra, India. He also holds a master's degree and PhD in Business Administration. His primary research interests are in artificial intelligence, big data, analytics, embedded systems, and e-commerce. He has supervised eighteen master's degree and twenty-four bachelor's degree students. He has published forty-seven papers in refereed journals and published six books with international publishers. He has also organized various workshops, sessions, conferences, and trainings. He has two patents filed and published in his name in India. He is a member of the Board of Studies (Computer Science and Engineering
The use of the star graph as a viable interconnection scheme for parallel computers has been examined by a number of authors in recent times. An attractive feature of this class of graphs is that it has sublogarithmic diameter and has a great deal of symmetry akin to the binary hypercube. In this paper we describe a new class of algorithms for embedding (a) Hamiltonian cycle (b) the set of all even cycles and (c) a variety of two- and multi-dimensional grids in a star graph. In addition, we also derive an algorithm for the ranking and the unranking problem with respect to the Hamiltonian cycle.
This paper introduces a new class of interconnection scheme based on the Cayley graph of the alternating group. It is shown that this class of graphs are edge symmetric and 2-transitive. We then describe an algorithm for (a) packet routing based on the shortest path analysis, (b) finding a Hamiltonian cycle, (c) ranking and unranking along the chosen Hamiltonian cycle, (d) unit expansion and dilation three embedding of a class of two-dimensional grids, (e) unit dilation embedding of a variety of cycles, and (f) algorithm for broadcasting messages. The paper concludes with a short analysis of contention resulting from a typical communication scheme. Although this class of graphs does not possess many of the symmetry properties of the binary hypercube, with respect to the one source broadcasting, these graphs perform better than does a hypercube, and with respect to the contention problem, these graphs perform better than do the star graphs and are close to the hypercube. 0 1993 by John Wiley & Sons, Inc.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.