Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Algorithms--Data processing (2)
- Algorithms (1)
- Computer architecture (1)
- Decomposition method (1)
- DiffServ (1)
-
- Encoding (1)
- Gate array circuits (1)
- Iterative methods (Mathematics) (1)
- Mappings (Mathematics) (1)
- Parallel scheduling (Computer scheduling) (1)
- Quality of service (Computer networks) (1)
- Queuing theory--Data processing (1)
- Sensor networks (1)
- Sequential machine theory (1)
- Wireless sensor networks (1)
- Wireless sensor nodes (1)
Articles 1 - 3 of 3
Full-Text Articles in Systems and Communications
A Graph-Based Approach To Symbolic Functional Decomposition Of Finite State Machines, Piotr Szotkowski, Mariusz Rawski, Henry Selvaraj
A Graph-Based Approach To Symbolic Functional Decomposition Of Finite State Machines, Piotr Szotkowski, Mariusz Rawski, Henry Selvaraj
Electrical & Computer Engineering Faculty Research
This paper discusses the symbolic functional decomposition method for implementing finite state machines in field-programmable gate array devices. This method is a viable alternative to the presently widespread two-step approaches to the problem, which consist of separate encoding and mapping stages; the proposed method does not have a separate decomposition step instead, the state's final encoding is introduced gradually on every decomposition iteration. Along with general description of the functional symbolic decomposition method's steps, the paper discusses various algorithms implementing the method and presents an example realisation of the most interesting algorithm. In the end, the paper compares the results …
Scheduling Architectures For Diffserv Networks With Input Queuing Switches, Mei Yang, Henry Selvaraj, Enyue Lu, Jianping Wang, S. Q. Zheng, Yingtao Jiang
Scheduling Architectures For Diffserv Networks With Input Queuing Switches, Mei Yang, Henry Selvaraj, Enyue Lu, Jianping Wang, S. Q. Zheng, Yingtao Jiang
Electrical & Computer Engineering Faculty Research
ue to its simplicity and scalability, the differentiated services (DiffServ) model is expected to be widely deployed across wired and wireless networks. Though supporting DiffServ scheduling algorithms for output-queuing (OQ) switches have been widely studied, there are few DiffServ scheduling algorithms for input-queuing (IQ) switches in the literaure. In this paper, we propose two algorithms for scheduling DiffServ DiffServ networks with IQ switches: the dynamic DiffServ scheduling (DDS) algorithm and the hierarchical DiffServ scheduling (HDS) algorithm. The basic idea of DDS and HDS is to schedule EF and AF traffic According to Their minimum service rates with the reserved bandwidth …
Free Regions Of Sensor Nodes, Laxmi P. Gewali, Navin Rongatana, Henry Selvaraj, Jan B. Pedersen
Free Regions Of Sensor Nodes, Laxmi P. Gewali, Navin Rongatana, Henry Selvaraj, Jan B. Pedersen
Electrical & Computer Engineering Faculty Research
We introduce the notion of free region of a node in a sensor network. Intuitively, a free region of a node is the connected set of points R in its neighborhood such that the connectivity of the network remains the same when the node is moved to any point in R. We characterize several properties of free regions and develop an efficient algorithm for computing them. We capture free region in terms of related notions called in-free region and out-free region. We present an O(n2) algorithm for constructing the free region of a node, where n is the number of …