Abstract: According to an embodiment of the invention, a method and apparatus are described for data bit sequences. According to an embodiment of the invention, a header is inserted in a data burst. One or more high priority messages of a first type are optionally inserted in the data burst starting after the header. One or more messages of a second type are optionally inserted into the data burst starting at an end of the data burst. One or more low priority messages of the first type are optionally inserted in the data.

Abstract: A method and a system for simulating and optimising the operating resources available in a coverage area of a mobile telephone network implemented by processing resources of at least one resource optimisation system and, can include definition, by an event-management module of the optimisation system, of a variation, called a perturbation, of at least one transmission of packets required within the network, from at least one statistical distribution map, selection of a set of cells determining a simulated zone, by means of an operating-resource control module, and then use of a routing algorithm to determine a routing path in the simulated zone, and to successively optimise the resources of the servers, definition by the event-management module, of data that represent at least one parameter relating to the transmission of the packets within each of the cells in the simulated zone, from amongst at least parameters of time-multiplexing of the packet, code-multiplexing of the packet, and the power required.

Abstract: A method and a system for simulating and optimising the operating resources available in a coverage area of a mobile telephone network implemented by processing resources of at least one resource optimisation system and, can include definition, by an event-management module of the optimisation system, of a variation, called a perturbation, of at least one transmission of packets required within the network, from at least one statistical distribution map, selection of a set of cells determining a simulated zone, by means of an operating-resource control module, and then use of a routing algorithm to determine a routing path in the simulated zone, and to successively optimise the resources of the servers, definition by the event-management module, of data that represent at least one parameter relating to the transmission of the packets within each of the cells in the simulated zone, from amongst at least parameters of time-multiplexing of the packet, code-multiplexing of the packet, and the power required.

Abstract: This present invention concerns a method and a system for simulating and optimising the use of resources available in a zone of coverage of a mobile telephone network (RT), characterised, firstly, in that it is implemented by processing resources (10) of at least one resource optimisation system (1) and, secondly, in that it includes the following stages determination (50), by an event management module (EM) of the optimisation system (1), of a variation, called a disruption, of at least one packet (P) transmission (T) required within the network (RT), from at least one statistical distribution map (CR) held in storage resources (11) of the optimisation system (1), and that consists of data representing data packet (P) transmissions (T), selection (52) of a set of cells determining a simulated zone (ZS), by a resource operating-resources control module (CL), and then use of a routing algorithm in order to determine a routing path (CP) in the simulated zone (ZS) and to successively optimise the resources of th

Abstract: A development and runtime framework for applications that execute in real-time operating systems. Application development is enhanced through simple instructions that allow a programmer to declare functions and sets of functions as tasks and supertasks, respectively, and manage the execution of functions, tasks and supertasks with priorities. A compiler or pre-processor provides tools for generating the code for tasks and supertasks, and the management code for managing execution. Function calls may be made directly to functions within supertasks via respective entrypoints, and the tasks are managed based on the functions being invoked. Within a supertask, a higher priority function may be runnable while a lower priority function of that supertask is suspended. A cookie is used to recognize when a register update for a supertask may be omitted, enabling more efficient context switching.

Abstract: A development framework and runtime environment for applications that execute in real-time operating systems. Application development is enhanced by providing simple instructions that allow a programmer to declare any function as a function managed with priority. Compiler tools implement priority function and the management code for managing execution at runtime. At runtime, priority functions are managed based on their respective priority level. The priority function information is stored when execution is to be delayed.

Abstract: Embodiments of the invention provide methods and apparatuses to provide concurrent execution of multiple instruction threads for independent control of two or more subsystems of a communication device. One embodiment includes a memory containing a plurality of instruction threads. Each of the plurality of instruction threads contains a timing specification and a corresponding timing reference. An execution unit is coupled to the memory. The execution unit concurrently executes each of the plurality of instruction threads in accordance with the timing specification and the corresponding timing reference of each instruction thread.

Abstract: According to an embodiment of the invention, a method and apparatus are described for data bit sequences. According to an embodiment of the invention, a header is inserted in a data burst. One or more high priority messages of a first type are optionally inserted in the data burst starting after the header. One or more messages of a second type are optionally inserted into the data burst starting at an end of the data burst. One or more low priority messages of the first type are optionally inserted in the data.