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.
According to the characteristics of data in coalmine industrial Ethernet ring networks and in order to guarantee the demand of the real-time data in it, a hybrid scheduling method with non-preemptive priority and EDF scheduling method based on the IEEE802.1p protocol is proposed in the switch. We calculate the maximum transmitting delay of the real-time data using network calculus theory. The result...
Given a graph G = (V, E), an edge-coloring of G is a function from the set of edges E to colors {1, 2. .., k} such that any two adjacent edges are assigned different colors. In this paper, we propose a self-stabilizing edge-coloring algorithm in a polynomial number of moves. The protocol assumes the unfair central d??mon and the coloring is a (Δ + 1)-edge-coloring of G, where Δ is the maximum degree...
Recent Internet traffic measurement shows that the majority of the TCP flows are short lived. Use of short flow highest priority scheduling provides the performance improvement in the internet traffic. However, long lived flows competing against the short flows starve at some point. We propose a novel two class Queue State Packet Scheduling mechanism, namely QSPS which treats long flows fairly without...
End-to-end rate-based congestion control algorithms are advocated for audio/video transport over the Internet instead of window-based protocols. Once the congestion controller has computed the sending rate, all rate-based algorithms proposed in the literature schedule packets to be sent spaced at intervals that are equal to the inverse of the desired sending rate. In this paper we show that such an...
Sleep scheduling protocols are widely used in wireless sensor networks for saving energy in sensor nodes. However, without considering the special requirements of object tracking, conventional sleep scheduling protocols may lead to intolerable degradation of tracking qualities when they are used in object tracking applications. To handle this problem, sleep scheduling protocols tailed for object tracking...
Computing capacity bounds of ad hoc networks, as well as optimizing radio resource allocation in order to approach those bounds is a hard task that have recently attracted the interest of the research community. In this paper we address the problem of jointly optimizing the routing of flows, the transmission scheduling over wireless links along the path, and the emitted power for bandwidth guaranteed...
In the multi-core and multiprocessor domain, there has been considerable work done on scheduling techniques assuming that real-time tasks are independent. In practice a typical real-time system usually share logical resources among tasks. However, synchronization in the multiprocessor area has not received enough attention. In this paper we investigate the possibilities of extending multiprocessor...
This paper will firstly analyze Ditian algorithm and Chi-fu Huang algorithm, pointing out the advantages and disadvantages for both of them, then propose a new algorithm called DSA combining the two algorithms, which can self-adapt its algorithm complexity and communication cost based on the density variation for the nodes in the network.
Resource allocation and task scheduling are two key technologies in grid computing system. The market-based resource allocation model is considered as a good one. In this paper, an on-line reverse auction method of resource allocation for computational grids was proposed to solve the problem of resource management considering the dynamic characteristics of computing resources in the computational...
Due to the recent popularization of digital broadcasting systems, selective contents broadcasting depending on viewers' preference have attracted great attention. For example, a user selects his answer and watches the video content for the answer in a quiz program. The conventional methods reduce the waiting time by producing an effective broadcast schedule. Although the server can deliver programs...
A method for ldquopreempting memoryrdquo is presented, where (parts of) the memory allocated to an active task may be reallocated to another task, without corrupting the state of the active task's job. The method is based on combining scalable components with fixed-priority scheduling with deferred preemption (FPDS).Real-time systems composed of scalable components are investigated. A scalable component...
Recently, two SRP-based synchronization protocols for hierarchically scheduled real-time systems based on fixed priority preemptive scheduling (FPPS) have been presented, i.e., HSRP and SIRAP. Preventing depletion of budget during global resource access, the former implements an overrun mechanism, while the later exploits a skipping mechanism. A theoretical comparison of the performance of these mechanisms...
This paper proposes dynamic material picking schedule, analyzes the problem of determining the formats of the communication infrastructure in a real-time picking system as well as determining the specifications of the communication protocols. An execution process of the sequence for picking/inputting tasks is defined. Relationship between communication specifications is discussed. Experimental results...
In this paper, we present a distributed multi-agent meeting scheduling system for mobile devices. This mobile agent system supports people on the move to locate feasible time slots to meet with each other, using their mobile devices. It negotiates the best suitable times integrating timetables and time preferences from the participants. Unlike to current approaches, the negotiation of the meeting...
The initial phase in a content distribution (file sharing) scenario is delicate due to the lack of global knowledge and the dynamics of the overlay. An unwise distribution of the pieces in this phase can cause delays in reaching steady state, thus increasing file download times. We devise a scheduling algorithm at the seed (source peer with full content), based on a proportional fair approach, and...
In a wireless network, the set of transmitting nodes changes frequently because of the MAC scheduler and the traffic load. Analyzing the connectivity of such a network using static graphs would lead to pessimistic performance results. In this paper, we consider an ad hoc network with half-duplex radios that uses multihop routing and slotted ALOHA for the network MAC contention and introduce a random...
Sensing coverage reflects the quality of surveillance of a field by a wireless sensor network (WSN). This paper investigates the problem of minimum connected k-coverage in WSNs, where each point in a field is covered (or sensed) by at least k active sensors while minimizing the necessary total number of active sensors and ensuring connectivity between them. In this paper, we propose two k-coverage...
Parallel applications typically run in batch mode, sometimes after long waits in a scheduler queue. In some situations, it would be desirable to interactively add new functionality to the running application, without having to recompile and rerun it. For example, a debugger could upload code to perform consistency checks, or a data analyst could upload code to perform new statistical tests. This paper...
This paper is focused in a mobile ad hoc network, where, the nodes can be in/out of it at any time. Furthermore, the interaction of processes running on different nodes result in the creation of new tasks, named as coordinated tasks. The execution of these new tasks requires the on-line reconfiguration of the nodes. Such reconfiguration involves the scheduling of new processes. In this work, this...
OSEK/VDX is an important specification in the field of automotive electronics and OSEK COM specifies the data communication behaviors inter-ECU and intra-ECU, but doesn't appoint specific underlying layer. In this paper,OSEK COM is implemented based on CAN bus. We present a model that dynamically generates properly CAN identifier to schedule I-PDUs of OSEK COM and transmit data that is longer than...
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.