Abstract: A wireless data platform comprises a plurality of processors. Channels of communication are set up between processors such that they may communicate information as tasks are performed. A dynamic cross compiler executed on one processor compiles code into native processing code for another processor. A dynamic cross linker links the compiled code for other processor. Native code may also be downloaded to the platform through use of a JAVA Bean (or other language type) which encapsulates the native code. The JAVA Bean can be encrypted and digitally signed for security purposes.

Abstract: A cache memory architecture 50, which may be, for example, a set associative cache memory, has a cache controller (52) with an internal register for storing the address of the active line currently latched in the output buffer of the high speed cache data array (56) which stores the cached data values from the main memory. If a memory access request specifies an address which would be contained in the active line, the cache look-up mechanisms are disabled and the data is taken from the output buffer. The efficiency of the cache can be increased by linking a program to memory such that the number of cache lines used by one or more program loops are minimized.

Abstract: A wireless data platform (10) comprises a plurality of processors (12,16). Channels of communication are set up between processors such that they may communicate information as tasks are performed. A dynamic cross compiler (80) executed on one processor compiles code into native processing code for another processor. A dynamic cross linker (82) links the compiled code for other processor. Native code may also be downloaded to the platform through use of a JAVA Bean (90) (or other language type) which encapsulates the native code. The JAVA Bean can be encrypted and digitally signed for security purposes.

Abstract: A method is provided for using a computer to select a travel route based on a selected performance criteria from a plurality of possible travel routes connecting a plurality of destinations. Information is input describing the location of each destination to be visited. For each pair of destinations, a connecting path having an optimum performance value based on the selected performance criteria is determined. An array of randomly ordered sequences is created with each sequence representing a unique ordering of the destinations to be visited. For each sequence, the optimum performance values for each connecting path of each pair of destinations are summed to obtain a total performance value for the routes described by the sequence. A genetic cellular automaton is iteratively applied to the array to determine the travel route having the selected performance criteria by computing a near optimum sequence of destinations.