37430657
On the boundary inequality for bandwidth of graphs
32397104
On 3-cutwidth critical graphs
The cutwidth of a graph G is the minimum congestion (the number of overlap edges) when G is embedded into a path. The cutwidth problem has been motivated from both applied and theoretical points of view. The characterization of forbidden subgraphs or critical graphs is always interesting in the study of a graph-theoretic parameter. In this paper we characterize the set of 3-cutwidth critical graphs by five specified elements.
45277891
On the bandwidth of convex triangulation meshes
Abstract Hochberg et al. (1995) obtained the bandwidth of triangulated triangles. In this paper, we consider a more general class of graphs, called convex triangulation meshes and denoted by T l , m , n . We show that the bandwidth of T l , m , n is min { l , m , n }.
43480564
PLS: a scheduler for pipeline synthesis
The authors point out that pipelining is an effective method for optimizing the execution of a loop, especially for digital signal processing (DSP) applications where data enter a circuit regularly. Although throughput and turnaround time are two important optimization criteria, previous work emphasized mainly the throughput. It is shown that the delay time for executing an iteration of a loop has a strong relationship to the cost of the registers and the controller. By minimizing the delay, there is more silicon area to allocate to additional resources, which in turn increases throughput. Forward scheduling and a backward scheduling are iteratively used to achieve this purpose. The algorithm, called PipeLining Scheduler or PLS, can be used to pipeline a loop with or without loop-carried dependencies. Real examples are used to illustrate the method. Experiments on benchmark examples show that considerable improvement over previous approaches is attained. >
10935949
A time-division algorithm for parallel simulation
Most parallel simulation algorithms (e.g., Chandy and Misra’s algorithm or the Time Warp algorithm) are based on a “space-division” approach. The parallelism of this approach is limited by the causality constraints. Another approach, the “time-division” approach, may provide more parallelism if the time domain is appropriately partitioned. We present a time-division parallel simulation algorithm that partitions the time domain via state matching, We show that linear speed up can be achieved. For a complex system, the best parallel simulation approach is to integrate “time-division” and “space-division” algorithms: the simulated system is partitioned into several subsystems; a subsystem may be simulated by the time-division approach (e. g., our algorithm), while the overall system is simulated by the space-division approach.
205212938
General Packet Radio Service (GPRS): architecture, interfaces, and deployment
This article provides an overview of General Packet Radio Service (GPRS). GPRS reuses the existing GSM infrastructure to provide end-to-end packet-switched services. Benefits of GPRS include efficient radio usage, fast set-up/access time and high bandwidth with multiple timeslots. GPRS also provides a smooth path for GSM evolution to the third generation mobile network. Specifically, a third generation network can continue to utilize the GPRS IP backbone network. We describe the GPRS network nodes and the interfaces among these nodes. Deployment issues for GPRS are also elaborated. Copyright 2001 John Wiley & Sons, Ltd.
53235726
Integrating logic retiming and register placement