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.
An SoC framework is presented, comprising of a plug-and-play infrastructure where the system communication is abstracted from the processing elements. A software scheduler is used with a hardware modelling environment for latency analysis. Using the framework, an LTE uplink data channel (PUSCH) receiver design is shown to meet the stringent latency targets.
Hundreds of papers over the last two decades have studied the theory of distributed scheduling in wireless networks, including a number of them on stability or utility maximizing random access. Several publications in 2008 studied an adaptive CSMA that in theory can approach utility optimality without any message passing under a number of assumptions. This paper reports the results from the first...
We introduce the problem of joint routing, scheduling and power control for multiple information flows in half-duplex, interference limited ad-hoc networks. The joint problem of optimizing for throughput is NP-Hard, and so we present an approximation of the problem and a general framework for solving it in O(N3) time. We attack the problem in two ways, first by presenting a reformulation and decomposition...
We consider a system consisting of N parallel queues, served by one server. Time is slotted, and the server serves one of the queues in each time slot, according to some scheduling policy. In the first part of the paper, we characterize the buffer overflow exponents and the likeliest overflow trajectories under the Longest Queue First (LQF) scheduling policy. Under statistically identical arrivals...
Wireless sensor networks (WSNs) enable a wealth of new applications where remote estimation is essential. Individual sensors simultaneously sense a dynamic process and transmit measured information over a shared channel to a central base station. The base station computes an estimate of the process state by means of a Kalman filter. In this paper we suppose that, at each time step, only a subset of...
This paper takes a philosophically new approach to throughput-optimal scheduling queueing systems with interference. All existing popular approaches (e.g. max-weight, greedy, ??pick-and-compare?? etc.) focus on the weights of individual queues. We take an alternative approach, by focusing instead on the aggregate queues of bottlenecks. A bottleneck is a set of mutually-interfering queues; a schedule...
CSMA policies are examples of simple distributed scheduling algorithms in wireless networks. In this paper, we study the delay properties of CSMA in the limit of large networks. We first define an ideal network under which CSMA becomes memoryless in that the delay to access the channel becomes an exponential r.v. independent of the past. We then show that, in the limit of large bipartite graphs with...
Department's course scheduling problem involves assigning courses, timeslots, and rooms to faculty members. However, due to the large number of constraints that must be handled, searching for an optimal solution for course scheduling problem is considered to be a complex and a time-consuming task. Methods used nowadays in many educational institutes depend on a manual process that is performed by...
To solve the problem of organization and maintenance of massive grid geographic data, this paper present a multi-pyramid mixed organization model basing on the research of original pyramid model. In multi-pyramid model, a main pyramid could include some sub pyramid. Each sub pyramid is independent and can be deployed to different host. The paper also discusses the schedule method of grid data in different...
The university course timetabling problem is a combinatorial optimization problem concerning the scheduling of a number of subjects into a finite number of timeslots in order to satisfy a set of specified constraints. The timetable problem can be very hard to solve, especially when attempting to find a near-optimal solutions, with a large number of instances. This paper presents a combination of particle...
Simulation is a significant way for performancespsila evaluations in switching and scheduling. The simulation software currently being existed has somewhat limitations in inheritability and extensibility. Based on current switching fabrics, by employing system level design method and object oriented technology, we designed and implemented a simulation platform called SPES for switching and scheduling...
Multiprocessor task scheduling problem has become increasingly interesting, for both theoretical study and practical applications. Theoretical study of the problem has made significant progress recently. However, it seems not to imply practical algorithms for the problem yet. In this paper, the offline version of the Multiprocessor scheduling problem on m-processor system is discussed for the case...
It has always been a great deal to balance both security and performance. But here we have presented a scenario in which a local scheduler of a networked system can schedule its jobs on and across other systems in the network securely. There by creating an environment in which no system is idle when even two systems are communicating. This clubs both distributed computing and load sharing. Thus high...
In order to deal with dynamic change in a manufacturing environment, all kinds of manufacturing resources are reorganized as multifarious agents with different resources and capability. According to the automation level and working mode of each functional agent to finish its tasks in the manufacturing environment, the manufacturing resource agents are divided into three categories. In order to construct...
Time Petri net and timed Petri net, in which transactions are constrained with time info, are widely used in task scheduling and performance analysis, whereas they are not effective enough for project performance analysis. Timing constraint Petri net (TcPN for short) is proposed in which places are endued with time delaying domain and time persisting domain simultaneously. Furthermore, all time constraints...
With the rapid growth of the Internet and other Internet-protocol related applications, many improvements have been made at the data link layer in wireless systems to support a wider variety of data services. However, further improvements in packet data admission, scheduling and policing between nodes in the network are necessary to maximize throughput and user satisfaction. In the above three, scheduling...
Active networks provide a programmable user-network interface that supports dynamic modification of the networkpsilas behavior. Network nodes, in addition to forwarding packets, perform customized computation on the messages flowing through them. Individual packets carry executable code, or references to executable code. Resources in an active network mainly comprise of CPU and bandwidth. The inherent...
The staged event-driven architecture (SEDA) is a new software framework, which is used to construct extreme concurrency Internet services systems. When the system is overloaded maintaining the quality of the requests processing is a difficult problem because both the processing costs and requests arrival rate are highly unpredicted. This paper presents a feedback control quality adaptation framework...
Jobshop scheduling is a typical NP hard problem. In the distributed manufacturing environment, it becomes a more intractable one with the characters of distributed object, multiple target and strong dynamic. A novel distribution jobshop scheduling method based on multi-agent mechanism and genetic algorithm is presented. A distributed scheduling system framework, which composed of several jobshop agents,...
In energy constrained wireless sensor networks, it is very important to conserve energy and prolong active network lifetime while ensuring proper operations of the network. To extend the lifetime of a sensor network, one common approach is to dynamically schedule sensors?? work/sleep cycles (or duty cycles). In our work we have considered cluster based heterogeneous wireless sensor network, by deploying...
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.