A method and system for organizing a package involving identifying an asset within an application, wherein the asset is determined by an asset boundary and the asset contains a logic/data part and an extended environment part; identifying the package within the application, wherein the package is a logical division of the application and wherein the package includes a plurality of assets; determining a package boundary identifying the scope of the package, wherein the package boundary may be determined by the asset boundary of at least one asset in the package; and organizing the package according to the package boundary, wherein the package including at least two assets.

Method, system, and structure for distributing and executing software and data on different network and computer devices, platforms, and environments

A system for testing middleware of applications in the N-tiered model. The test system contains test code generators, test engines to execute multiple copies of the test code and a data analyzer to analyze and present the results to a human user. The system is able to automatically generate test code to exercise components of the middleware using information about these components that would otherwise be available to the application under test. Multiple copies of the test code are executed in a synchronized fashion. Execution times of multiple events are recorded and then presented in one of several formats. With the system, an application developer can identify components that represent performance bottlenecks or can gather information on deployment properties of individual components that can be used to enhance the performance of the application under test.

Method and system for software object testing

Cloud computing is the development of distributed computing, parallel computing and grid computing, or defined as the commercial implementation of these computer science concepts. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization problem, and many meta-heuristic algorithms have been proposed to solve it. A good task scheduler should adapt its scheduling strategy to the changing environment and the types of tasks. In this paper a cloud task scheduling policy based on ant colony optimization algorithm compared with different scheduling algorithms FCFS and round-robin, has been presented. The main goal of these algorithms is minimizing the makespan of a given tasks set. Ant colony optimization is random optimization search approach that will be used for allocating the incoming jobs to the virtual machines. Algorithms have been simulated using Cloudsim toolkit package. Experimental results showed that the ant colony optimization outperformed FCFS and round-robin algorithms.

Cloud task scheduling based on ant colony optimization.

Methods and systems consistent with the present invention (FIG. 2, 200, 202, 204, 206, 208) provide an improved software development tool that generates code corresponding to a distributed computing component that contains methods of a plurality of types and that displays a graphical representation of the code with a separately delineated display area for each type (FIG. 13, 1300, 1302, 1304). The improved software development tool also compiles, deploys, and debugs the distributed computing component with a client software component using methods and systems consistent with the present invention (FIG. 19, 1900).

Methods and systems for supporting and deploying distributed computing components

A computer user interface generation system and method is disclosed, wherein computer user interfaces can be generated dynamically during activation of the computer application for which the generated user interface provides user access to the functional features of the application. The generated user interface may be a graphical user interface (GUI) that uses instances of various user interaction techniques. A user interface specification is provided in a configuration database for generating the user interface, and by changing the user interface specification in the configuration database, the user interface for the computer application can be changed during activation of the application.

Computer user interfaces that are generated as needed

A technique for providing a transaction management subsystem for an enterprise computing environment in which multiple concurrent and/or nested transactions may access the same Enterprise JavaBeans (EJBs) simultaneously. The transaction management subsystem provides a view for each transaction which includes an independent version of an EJB's business logic and its instance data. When an application or application user has made modifications to an EJB version and requests to commit the modifications, a determination is first made as to whether committing the modifications will result in an unacceptable data conflict with other versions of the same EJB. If no unacceptable data conflict will occur, and after resolution of those conflicts that can be resolved, the modifications are committed. The management subsystem also supports nested transactions, where each subtransaction may have an independent view of an EJB. Subtransactions may commit or roll back independently. Changes made by a transaction are represented using a tree structure that is internally managed by the application.

Technique for managing enterprise JavaBeans (™) which are the target of multiple concurrent and/or nested transactions

A method, system, and computer program product for improving the performance of distributed object systems. A remote object is replicated to the node of the distributed system from which it is accessed. The scope of the replication is a transaction. Thereafter, method invocations on the object occur locally, avoiding the performance overhead of frequent round trips to the remote persistent object store. Changes made to a replicated object by a transaction are represented using a tree structure that is internally managed by the application. When an application or application user has made modifications to a replicated object and requests to commit the modifications, a determination is first made as to whether committing the modifications will result in an unacceptable data conflict. If no unacceptable data conflict will occur, and after resolution of those conflicts that can be resolved, the modifications are committed. Nested transactions are supported, where each child transaction may commit or roll back independently.

Transaction-scoped replication for distributed object systems

A technique for using working set hints and query signatures to optimize the selection and execution of fixed, static services or queries of information from a database, object server, or similar data repository. The working set hints describe how to read ahead when doing a database query, in order to retrieve data in a single database access that a task is likely to need as it continues executing. By storing the working set hints externally from the application code, the hints can be modified as experience is gained about the true working set that is required during use of each task without having to modify and recompile the application itself. Signatures are created and associated with query commands or services. These signatures are compared to the working set hints for a task when the task traverses an association and needs to retrieve data from the data repository. The signature which best matches the task's working set hints is automatically selected, and the query or service associated with this signature is then executed, providing an optimized database retrieval operation.

Optimizing fixed, static query or service selection and execution based on working set hints and query signatures

A technique for creating and using a structured cache to increase the efficiency of reading persistent objects from a database. The structured cache is comprised of an object cache, an associations cache, and a data cache. Data read-ahead is used to retrieve rows from a relational database in advance of an application's need for the data. Entries are created in the data cache and association cache as the rows are processed. The data cache stores data in unstructured binary format, delaying the expense of instantiation until an object is requested by the application. At that time, data is retrieved from the data cache, an object is instantiated from the data, and an entry is created in the object cache. This approach also saves storage space that would be wasted if objects were instantiated upon retrieval, but never used. The association cache stores members of an association, organized by member key within owner key for each association. According to the preferred embodiment, maintaining cache consistency is not required, further increasing the efficiency gains that can be realized using this technique.

Structured cache for persistent objects

We consider geographically distributed data centers forming a collectively managed cloud computing system hosting multiple applications, each subject to Service Level Agreements (SLA). The Service Level Agreements for each application require the response time of a certain percentile of the input requests to be less than a specified value, with the non-conforming requests being charged a penalty. We present a novel approach of heuristic-based request scheduling at each server, in each of the geographically distributed data centers, to globally minimize the penalty charged to the cloud computing system. We evaluate two variants of our heuristic-based approach, one based on the simulated annealing method of neighborhood searches and another based on gi-FIFO scheduling, which has been analytically proven to be the best schedule for percentile goals in a single machine, multi-class problem. We also compare our approaches with First In First Out (FIFO) and Weighted Round Robin (WRR) scheduling policies.

Timo J. Salo

Papers

Technique for managing enterprise JavaBeans (™) which are the target of multiple concurrent and/or nested transactions

Transaction-scoped replication for distributed object systems

Optimizing fixed, static query or service selection and execution based on working set hints and query signatures

Structured cache for persistent objects

Heuristic-Based Request Scheduling Subject to a Percentile Response Time SLA in a Distributed Cloud