53235373
Performance-optimal clustering with retiming for sequential circuits
6763648
An effective methodology for functional pipelining
We address the problem of given a loop behavior, a target initiation interval and resource constraints, scheduling a loop in a pipelined fashion such that the iteration time (turn-around time) is minimized. The iteration time is an important quality measure of a data path design because of its direct correlationship with both the storage and the control costs. Our scheduler starts with performing an As Soon As Possible Pipelined (ASAPp) scheduling without regard to the resource constraint. It then resolves the resource constraint violations, if there are any, by repeatedly rescheduling some operations.
6671545
LES: A Layout Expert System
In this paper we describe an expert system for layout generation in a hierarchical VLSI design system. It applies a combination of rule- and algorithmic-based techniques on a new layout style. Experimental results have demonstrated the superiority of this expert system against various standard-cell systems and its competitiveness with human designers.
7180014
A software architecture for GPRS session management
General packet radio service (GPRS) provides efficient access to the integrated services Internet from wireless networks. When the GPRS-attached mobile station attempts to send or receive data, a packet data protocol (PDP) context shall be established. The GPRS session management (SM) supports the PDP context handling, which consists of PDP context activation, deactivation, and modification procedures. In this paper, we propose an SM software architecture for the serving GPRS support node. Our design goals are to achieve compatibility, modularity, and flexibility. More importantly, our approach can accommodate the design of the SM software architecture for third-generation wireless networks. Copyright © 2001 John Wiley & Sons, Ltd.
29816088
GPRS-based WLAN authentication and auto-configuration
This paper proposes an authentication and auto-configuration mechanism for wireless LAN (WLAN) based on short message service of mobile telecommunications network. Our approach automates the authentication and WLAN configuration setup procedure without involving the users.
6968436
Optimal memory management for time warp parallel simulation
Recently there has been a great deal of interest in performance evalution of parallel simulation. Most work is devoted to the time complexity and assumes that the amount of memory available for parallel simulation is unlimited. This paper studies the space complexity of parallel simulation. Our goal is to design an efficient memory management protocol which guarantees that the memory consumption of parallel simulation is of the same order as sequential simulation. (Such an algorithm is referred to as a optimal.) First, we derive the relationships among the space complexities of sequential simulation, Chandy-Misra simulation [2], and Time Warp simulation [7]. We show that Chandy-Misra may consume more storage than sequential simulation, or vice versa. Then we show that Time Warp never consumes less memory than sequential simulation. Then we describe cancelback, an optimal Time Warp memory management protocol proposed by Jefferson. Although cancelback is considered to be complete solution for the storage management problem in Time Warp, some efficiency issues in implementing this algorithm must be considered. We propose an optimal algorithm called artifical rollback. We show that this algorithm is easy to implement and analyze. An implementation of artificial rollback is given, which is integrated with processor scheduling to adjust the memory consumption rate based on the amount of free storage available in the system.
18189663
Reducing location update cost in a PCS network
Location tracking operations in a personal communications services (PCSs) network are expensive. Several strategies have been proposed to reduce the location update cost. This paper studies a special case of a location tracking algorithm called the alternative location algorithm. This special case is referred to as the two location algorithm (TLA). An analytical model is proposed to compare the performance of the TLA and the IS-41 protocol. Our study indicates that the performance of the TLA is significantly affected by the user moving patterns and the call traffic. If the user mobility is higher than the call frequency or the user tends to move back to the previously visited registration areas, then the TLA may significantly outperform IS-41. We also observe that the variance of the portable residence times in registration areas has an impact on the performance of the TLA (i.e., better performance is expected for larger variance).
10171431
Parallel Trace-Driven Simulation of Packet-Switched Multiplexer Under Priority Scheduling Policy
Abstract We proposed an approximate parallel simulation for packet loss of packet-switched multiplexer with priority scheduling policy. The speedup of the algorithm over the sequential simulation is O(N), where N is the number of processors. For packets with priority level m, the number Lm of lost packets computed in the algorithm is bounded by the exact number LmE within 2(N−1) packets. That is, |Lm−LmE| ⩽2(N−1).