Diabetes management |
| According to a first aspect of the present invention there is provided a method of predicting the ... |
|
Method and apparatus for code translation optimization |
| OF PREFERRED EMBODIMENTS Generally, the present invention provides a method of optimizing software ... |
|
Method and computer system for loading objects |
| To achieve the foregoing objectives, the present invention executes the following steps in a ... |
|
Graphical design processing apparatus for assessing and modifying design of components |
| It is therefore an object of the present invention to provide a graphic data processing apparatus ... |
|
Developers tool for object-oriented programming |
| The present invention fulfills this need in the art by providing a software developer's tool to ... |
|
Method and apparatus for storing templates in a component system |
| The present invention provides a component system in which a number of base applications, i.e. ... |
|
Method and apparatus for executing tasks by following a linked list of memory packets |
| OF THE EMBODIMENT FIG. 1 is a high level block diagram of a task flow computing machine 10. M... |
|
Optical fiber bus controller |
| FIG. 1 illustrates system 100 which implements the invention. System 100 comprises a number of ... |
|
Low-latency real-time dispatching in general purpose multiprocessor systems |
| The present invention provides a method of real-time dispatching in a general purpose ... |
|
dbX: a persistent programming language model |
| The persistent programming language model described herein solves the problem of seamlessly ... |
|
|
Methods for maximizing routability in a programmable interconnect matrix having less than full connectability
| Details |
Inventors: Nazarian, Hagop A.; Douglass, Stephen M.; Graf, W. Alfred; Raza, S. Babar; Rajan, Sundar; Borzin, Shiva Sorooshian; Newman, Darren;
Assignee: Cypress Semiconductor Corp. (San Jose, CA)
Primary Examiner: Teska; Kevin J.
Assistant Examiner: Frejd; Russell W.
Attorney, Agent or Firm: Blakely, Sokoloff, Taylor Zafman LLP
Methods for designing a programmable interconnect matrix having reduced connectivity to achieve maximum routability for the reduced connectivity. An array of multiplexors, each having a multiplexor width w.sub.mux that is less than number of input conductors for the programmable matrix, are coupled to the input conductors of the programmable interconnect matrix such that the number of input signals shared between any two multiplexors is less than the multiplexor width w.sub.mux and such that each input signal has approximately the same number of chances to route. To better ensure the successful routing of input signals by a programmable interconnect matrix designed according to the present methods, improved routing methods are also described. According to a first embodiment, routing is accomplished by swapping successfully routed input signals with a blocked input signal and determining whether the input signal that has been swapped out may be routed through available multiplexors. According to a second embodiment, a predictive swapping technique is used whereby successfully routed signals qualified to provide a blocked signal with a route are first checked to determine whether a successful routing will be provided before swapping in the blocked output signal. |
|
DETAILED DESCRIPTION The connectivity, connectability and routability of a connection circuit, hereinafter "programmable interconnect matrix" or "PIM," are, as stated above, characteristics of the PIM that are quite interrelated. Because the connectivity of the PIM directly affects the amount of die space required for the PIM, the connectivity of the PIM is more likely to be the characteristic that drives the design of the PIM. Regardless of the level of connectivity chosen by the designer, the connectability of the PIM should be optimized to provide maximum routability for the desired level of connectivity. A purchaser of the PIM determines which input conductors of the PIM are connected to which output conductors of the PIM by programming the programmable elements of the PIM. Because the manufacturer cannot predict every use of the PIM, providing maximum routability for a given level of connectivity better ensures that the purchaser of the PIM will be able to successfully program the PIM. The discussion of PIMs that follows assumes that the pin assignment for the associated CPLD remains fixed. In this manner, the routability of a PIM having a given level of connectability can be accurately assessed because, as described above, even a PIM that provides a maximum of one chance to route for each input signal is "fully routable" in the sense that the pin assignments of the CPLD can be altered to provide a route for any particular combination of input signals. To reduce the die area required to implement a PIM, a basic assumption for any PIM design is that the connectivity of the PIM is such that the PIM is less than fully connectable. Thus, not every input conductor of the PIM can be connected to every output conductor of the PIM. Given this assumption, the first question is whether the PIM will also be less than fully routable. If a fully routable PIM is desired, the minimum level of connectivity is constrained, as described below. If full routability is not required, the level of connectivity is not constrained, but the PIM design should be optimized such that maximum routability and connectability are provided for the given level of connectivity
|
| Related patents |
|
|
Microprocessor integrated circuit working in internal ROM and external RAM mode
The present invention is aimed at proposing a more efficient, less lengthy and less costly system to develop a microprocessor integrated circuit incorporating the ...
|
|
|
Method and apparatus for resetting, enabling and freezing a communication device in a diagnostic process
What is claimed is: 1. A communication system, comprising: a host interface for providing a host with access to internal elements of said communication system, and ...
|
|
|
Code instrumentation system with non intrusive means and cache memory optimization for dynamic monitoring of code segments
Accordingly, the present invention is directed to a system and method for monitoring performance in an information handling system in a minimally intrusive manner. The ...
|
|
|
Method and apparatus for dynamically optimizing an executable computer program using input data
According to principles of the invention, a method and apparatus for using input data to optimize a computer program for execution on a target computer is provided. I...
|
|
|
Method and apparatus for profiling indirect procedure calls in a computer program
As discussed in the Background section, the generation of profile data for direct procedure calls is relatively straightforward. However, the generation of profile data ...
|
|
|
Profile driven optimization of frequently executed paths with inlining of code fragment (one or more lines of code from a child procedure to a parent procedure)
Unfortunately, traditional inlining is often unable to substantially reduce the procedure call overhead of a program where to do so would be highly advantageous. In ...
|
|
|
Method of, system for, and computer program product for providing efficient utilization of memory hierarchy through code restructuring
The invention disclosed herein comprises a method of, a system for, and an article of manufacture for providing code restructuring based on profiling information and ...
|
|
|
Software reconfiguration engine
The present invention relates generally to computer system software development and maintenance. More particularly, the invention relates to a reconfiguration system for ...
|
|
|
Automated validation and verification of computer software
The present invention discloses a method and apparatus for automatic validation and verification of computer software. The software to be tested is first retrieved from ...
|
|
|
System for generating test data
A system for generating test data that overcomes these and other problems has a data structure definition system, a message creation system, and an execution system. The ...
|
|
|