A dynamic linking system can be designed to dynamically resolve symbol references of pages associated with executable code as the pages are paged into virtual memory. The operating system can include a dynamic linker that uses metadata in the pages to determine symbol references that reference other code or values. Other code can include code in shared libraries. The dynamic linker can generate a data structure containing the symbol references in a small and dense format. The dynamic linker can send the data structure and other relevant data to the kernel once the symbol references have been identified. The kernel can perform the functions related to resolving the symbol references. For example, the kernel can resolve the symbol by determining a pointer value for the symbol, wherein the pointer value can be used to point to code or values. The kernel can resolve the symbol references and store the data structure, which contains the resolved symbol references.

The objective of the present invention is to prevent a conflict between variable names and consequently the unintentional overwriting of data when a plurality of programs that define a shared variable exist. A control device (1) is equipped with a program management part (11), a data storage part (13a), and a shared variable symbol table (13b). The program management part (11) acquires an identifier for a first user program, generates a shared variable name that includes the identifier and a variable name of a shared variable defined in the first user program, associates the shared variable name and an address of the shared variable with each other, and records these in the shared variable symbol table (13b).

Techniques for an ultra-fact software compilation of source code are provided. A compiler receives software code and may divide it into code sections. A map of ordered nodes may be generated, such that each node in the map may include a code section and the order of the nodes indicates an execution order of the software code. Each code section may be compiled into an executable object in parallel and independently from other code sections. A binary executable may be generated by linking executable objects generated from the code sections. The methodology significantly differs from existing source code compilation techniques because conventional compilers build executable sequentially, whereas the embodiments divide the source code into multiple smaller code sections and compile them individually and in parallel. Compiling multiple code sections improves the compilations in order of magnitude from conventional techniques.

Techniques for an ultra-fact software compilation of source code are provided. A compiler receives software code and may divide it into code sections. A map of ordered nodes may be generated, such that each node in the map may include a code section and the order of the nodes indicates an execution order of the software code. Each code section may be compiled into an executable object in parallel and independently from other code sections. A binary executable may be generated by linking executable objects generated from the code sections. The methodology significantly differs from existing source code compilation techniques because conventional compilers build executable sequentially, whereas the embodiments divide the source code into multiple smaller code sections and compile them individually and in parallel. Compiling multiple code sections improves the compilations in order of magnitude from conventional techniques.

The present disclosure discloses a method and apparatus for loading an application. An embodiment of the method comprises: selecting, in a programmable read-only memory, a storage space for storing a preset data section in an executable file of an application; copying the preset data section to a memory, and relocating the preset data section based on a start address of the storage space; and copying the relocated preset data section to the storage space. A relocation of a code portion of the executable file in the memory is implemented, and the relocated code portion is then written back into the programmable read-only memory, so that the relocation of the code portion can be completed only by one erase operation for a memory block, thereby reducing system overheads during the application loading process, and reducing wear of the programmable read-only memory.

The present disclosure discloses a method and apparatus for loading an application. An embodiment of the method comprises: selecting, in a programmable read-only memory, a storage space for storing a preset data section in an executable file of an application; copying the preset data section to a memory, and relocating the preset data section based on a start address of the storage space; and copying the relocated preset data section to the storage space. A relocation of a code portion of the executable file in the memory is implemented, and the relocated code portion is then written back into the programmable read-only memory, so that the relocation of the code portion can be completed only by one erase operation for a memory block, thereby reducing system overheads during the application loading process, and reducing wear of the programmable read-only memory.

A method of communicating survey questions to a list of participants; the list of participants obtained by including a proxy email address as a participant address in a list of participant email addresses whereby a web enabled server receiving an invitation addressed to the proxy email address also receives the list of participant email addresses; the web enabled server subsequently transmitting survey questions to the participants identified by the list of participant email addresses. Also disclosed is method of assembling programme code for execution on a platform. Also disclosed is a portal which provides a facility for additional communication to be added to meeting results. The communication will be altered to the specific preferences of each recipient and will be added to any Communication that is to be sent by MeetingQuality within the specified timeframe.

A method of communicating survey questions to a list of participants; the list of participants obtained by including a proxy email address as a participant address in a list of participant email addresses whereby a web enabled server receiving an invitation addressed to the proxy email address also receives the list of participant email addresses; the web enabled server subsequently transmitting survey questions to the participants identified by the list of participant email addresses. Also disclosed is method of assembling programme code for execution on a platform. Also disclosed is a portal which provides a facility for additional communication to be added to meeting results. The communication will be altered to the specific preferences of each recipient and will be added to any Communication that is to be sent by MeetingQuality within the specified timeframe.

The objective of the present invention is to prevent a conflict between variable names and consequently the unintentional overwriting of data when a plurality of programs that define a shared variable exist. A control device (1) is equipped with a program management part (11), a data storage part (13a), and a shared variable symbol table (13b). The program management part (11) acquires an identifier for a first user program, generates a shared variable name that includes the identifier and a variable name of a shared variable defined in the first user program, associates the shared variable name and an address of the shared variable with each other, and records these in the shared variable symbol table (13b).

A method includes receiving an application, where the application includes an extension and a metadata model. The method also includes instantiating the extension and firing an event. The method also includes upon detecting the event at the instantiated extension, creating metadata associated with the application, collecting the metadata associated with the application, and revising the metadata model based on the collected metadata.