Abstract: Embodiments of the present invention provide a method, system and computer program product for a smart cache for server testing in an application development tool. In an embodiment of the invention, method of smart caching of service data during application testing in a development tool for a service invoking application is provided. The method includes loading source code for a computer program into a development tool executing in memory of a computing system. The method further includes executing the source code from the development tool. In this regard, the execution of the source code invokes a service responsive to a directive to invoke the service disposed in the source code. Finally, the method includes invoking the service in a container instance in response to a first invocation of the service from the computer program.

Abstract: The claimed subject matter provides a method for performing a static analysis of concurrent programs. The method includes determining that a static analysis of the first concurrent program generates a warning for an input. The method also includes determining whether a static analysis of the second concurrent program generates the warning for the input. The method further includes removing the warning if the static analysis of the second concurrent program generates the warning.

Abstract: This disclosure generally relates to analyzing and validating computer software written in an object-oriented scripting language such as Javascript. The analyzing and validating method comprises marking an object in source code of a software program written in an object-oriented scripting language such as JavaScript; identifying one or more locations paired with the object in the source code of the software program; constructing a control flow graph (CFG) for the software program; and determining whether there is any path in the CFG that leads from a first node corresponding to the marked object to a second node corresponding to any identified location paired with the object. In an embodiment, the object is marked in source code using a keyword.

Abstract: A computer system for programming applications in a programming environment, including, a computer adapted to execute software to form a programming environment enabling creation of a software application using multiple programming languages, a multidimensional debugger installed on the computer; wherein the multidimensional debugger is made up from two or more debuggers each for use in debugging a different programming language, wherein the two or more debuggers use a common work memory to share information; and wherein the two or more debuggers use a common user interface.

Abstract: An analysis tool analyzes a software system by simulating runtime binding in order to identify function-level code dependencies. The tool receives a list of one or more entry point functions and identifies other functions that can be invoked if the entry point functions are executed. The tool generates a tracker graph having tracker nodes representing classes that can be instantiated from the entry points. Each tracker node identifies functions/methods in that class that can be invoked from the entry points. If the software system uses an object-relational mapping to a database, the tracker graph also identifies the portions of the database that can be accessed from the entry points. The tool can be used to partition the functionalities of the software system into core and non-core functionalities in order to support upgrading while maintaining high-availability.

Abstract: A protocol independent programming tool for constructing control logic. The control logic may be constructed without dealing in the details of an underlying protocol. The protocol details may be abstracted and exposed and generic points used in constructing the logic. The tool may automatically map or translate the points used in the logic to protocol specific entities.

Abstract: Processes in a message passing system may be launched when messages having data patterns match a function on a receiving process. The function may be identified by an execution pointer within the process. When the match occurs, the process may be added to a runnable queue, and in some embodiments, may be raised to the top of a runnable queue. When a match does not occur, the process may remain in a blocked or non-executing state. In some embodiments, a blocked process may be placed in an idle queue and may not be executed until a process scheduler determines that a message has been received that fulfills a function waiting for input. When the message fulfills the function, the process may be moved to a runnable queue.

Abstract: A system and method for early platform dependency preparation of intermediate code representation during bytecode compilation in a virtual machine (VM), or other runtime environment, and particularly for use in a system that includes a Java Virtual Machine (JVM). Current techniques for separating the platform dependent intermediate representation from the platform independent intermediate representation using a watertight abstraction layer gives non-optimal side effects (such as compiler source code duplication or inefficiency in the generated code). Embodiments of the present invention enable the compiler to construct platform dependent idioms using medium level intermediate code, and maintain the platform dependent construct all the way to the final native code.

Abstract: Interface optimization is provided using a closed system in which all the individual software components in the system are known to the compiler at a single point in time. This knowledge enables significant opportunities to optimize the implementation of interfaces on a set of implemented objects. When code is compiled, because the compiler knows the full list of interfaces and the objects which implement the interfaces, it can improve execution and working set (i.e., recently referenced pages in a program's virtual address space) when implementing the interfaces on objects. This improvement may be realized by reducing the size of interface lookup tables which map each interface to the object types which implement that particular interface.

Abstract: A technique for optimizing a program by reusing an execution result of a subclass test function. It includes a reusability determining unit to determine reusability of code of a subclass test function based on whether access to a global memory includes only access for reading out type information specified in a function call, a profiling unit configured to store an execution result of code determined to be reusable and specified information in a storage device in association with actually accessed type information, a reuse processing unit configured to reuse, in response to detection of a function call for calling the code determined to be reusable, the execution result on condition that the pieces of specified information specified in the function calls match, and a monitoring unit configured to monitor the type information associated with the execution result and prohibit reuse of the execution result if the type information is changed.

Abstract: An illustrative embodiment provides a computer-implemented process for algorithm complexity identification through inter-procedural data flow analysis receives a call graph to form a set of received nodes in a static analysis framework, identifies a parent node in the set of received nodes to form an identified parent, traverses the call graph from the identified parent node to a node to identify a function within the node to form an identified function. Each identified function is analyzed to form a complexity value in a set of complexity values. Responsive to a determination that node analysis is complete, and responsive to a determination that path analysis is complete, determines whether path analysis for the identified parent is complete. Responsive to a determination that path analysis for the identified parent is complete, sum the complexity values in the set of complexity values for the identified parent and return the complexity value for the identified parent to a requester.

Abstract: A method for compiler-guided optimization of MapReduce type applications that includes applying transformations and optimizations to JAVA bytecode of an original application by an instrumenter which carries out static analysis to determine application properties depending on the optimization being performed and provides an output of optimized JAVA bytecode, and executing the application and analyzing generated trace and feeds information back into the instrumenter by a trace analyzer, the trace analyzer and instrumenter invoking each other iteratively and exchanging information through files.

Abstract: Methods and apparatus to provide loop parallelization based on loop splitting and/or index array are described. In one embodiment, one or more split loops, corresponding to an original loop, are generated based on the mis-speculation information. In another embodiment, a plurality of subloops are generated from an original loop based on an index array. Other embodiments are also described.

Abstract: A method and system for dynamically identifying and loading a version of a runtime for custom code of a host application without modifying the host application is provided. A loading system dynamically identifies the version of the runtime during execution of the host application. The loading system is also dynamically linked into the host application so that its algorithm for identifying the version of the runtime can be modified without modifying the host application. When requested by the host application to load custom code, the loading system identifies a version of the runtime to load, loads the identified version of the runtime, and then requests a load component of the loaded version of the runtime to load the custom code.

Abstract: An electronic apparatus has a normal mode and an energy saving mode for reducing power consumption, and includes a main control unit, a sub control unit, a main storage unit, and a sub storage unit. The sub control unit includes a processing unit performing a part of an update process by storing software update data in the sub storage unit when a software update request is received during the energy saving mode. The main control unit includes a processing unit performing a rest of the update process by moving or copying the software update data from the sub storage unit to the main storage unit and by updating software stored in the main storage unit with the software update data after the electronic apparatus returns from the energy saving mode to the normal mode.

Abstract: An electronic device comprising at least a motherboard (102) with a digital control unit (101), a plurality of resources (105, 106, 107, 108, 109), and at least one memory support (104) containing a firmware and able to hold an executable program. The firmware is able to carry out a virtualization of the resources of the electronic device, assigning virtual addresses to these resources. The executable program exchanges information or instructions with the electronic device by using these virtual addresses.

Abstract: Compatibility and consolidation analyses can be performed on a collection of systems to evaluate the 1-to-1 compatibility of every source-target pair, evaluate the multi-dimensional compatibility of specific transfer sets, and to determine the best consolidation solution based on various constraints including the compatibility scores of the transfer sets. The analyses can be done together or be performed independently. These analyses are based on collected system data related to their technical configuration, business factors and workloads. Differential rule sets and workload compatibility algorithms are used to evaluate the compatibility of systems. The technical configuration, business and workload related compatibility results are combined to create an overall compatibility assessment. These results are visually represented using color coded scorecard maps.

Abstract: An apparatus updates firmware running on nodes in a wireless mesh network. The apparatus includes a code image DB for storing a code image running on each node in the mesh network and version of the code image. The apparatus further includes an update script generator for generating, if a code image running on a target node in the mesh network needs to be updated, a code update script with reference to the code images of the target node and its neighboring nodes stored in the code image DB, and performing update of the target node using the code update script.

Abstract: In a method for making a recommendation for installing a software patch on a target computer, a computer identifies a first and a second set of computers from a group of computers. Each computer in the first set has hardware and software components, which are identical to each other or differ from each other by less than a predetermined measure. Each computer in the second set has hardware and software components, which are identical to each other or differ from each other by less than a predetermined measure. The computer selects one of the first and the second sets of computers such that the selected set of computers includes a higher number of computers with the software patch already installed.

Abstract: Methods, systems, and computer program products that automatically control the installation of software applications on a device are provided. The installation of a software application on a device is detected. The installation is temporarily halted and information about the detected software application installation is collected. A danger level of the detected software application is assessed based upon the collected information. Installation of the detected software application is allowed to continue if the assessed danger level is below a threshold level and installation of the detected software application is terminated if the assessed danger level is above the threshold level.

Abstract: A provisioning server can import a software distribution and determine the type of distribution in order to integrate the software distribution in the software provisioning environment. The provisioning server can be configured to determine a type for the software distribution. Once determined, the provisioning server can be configured to locate a configuration template that matches the type of the software distribution. The configuration template can allow the generation of a configuration file that enables the software distribution to be incorporated into software provisioning processes, automatically. Once located, the provisioning server can be configured to generate a profile for the imported software distribution.

Abstract: Systems and methods for deploying a virtual machine (VM) on a host are provided. An exemplary method comprises notifying a host to download a master copy of a VM image from a remotely located network storage device, in response to a service provider providing a definition manifest for a service request supported by the VM, wherein the host deploys the VM directly from the VM image downloaded to a storage medium locally connected to the host machine, wherein deployment of the VM allows the host to locally service the service request associated with the definition manifest, wherein the host replicates copies of the VM image, in response to receiving additional service requests to create one or more VM clones; wherein the host customizes the one or more VM clones based on the definition manifest.

Abstract: A technique for operating a virtual switch includes determining network connection requirements for virtual machines controlled by a virtual machine monitor. Resources available, for processing data traffic of the virtual machines, are also determined. Finally, based on the network connection requirements and the resources available, a port of a virtual switch is selected to operate as a virtual Ethernet bridge or a virtual Ethernet port aggregator.

Abstract: A heterogeneous processing system is described herein that provides a software hypervisor to autonomously control operating system thread scheduling across big and little cores without the operating system's awareness or involvement to improve energy efficiency or meet other processing goals. The system presents a finite set of virtualized compute cores to the operating system to which the system schedules threads for execution. Subsequently, the hypervisor intelligently controls the physical assignment and selection of which core(s) execute each thread to manage energy use or other processing requirements. By using a software hypervisor to abstract the underlying big and little computer architecture, the performance and power operating differences between the cores remain opaque to the operating system. The inherent indirection also decouples the release of hardware with new capabilities from the operating system release schedule.

Abstract: A technique for operating a virtual switch includes determining network connection requirements for virtual machines controlled by a virtual machine monitor. Resources available, for processing data traffic of the virtual machines, are also determined. Finally, based on the network connection requirements and the resources available, a port of a virtual switch is selected to operate as a virtual Ethernet bridge or a virtual Ethernet port aggregator.

Abstract: A method for storing and processing data includes providing an operating system (OS) virtualization running on a processor and having a plurality of containers. Each container may prevent privilege escalation by a user to an administrator of a global zone running the OS virtualization. The method may also include providing a hardware virtual machine (HVM) for the user, the HVM encapsulated in one of the containers. A system for storing and processing data is provided that includes an operating system (OS) virtualization stored in a memory and running on a processor. The OS virtualization has a plurality of containers, and each container prevents privilege escalation by a user to an administrator of a global zone running the OS virtualization. The HVM may be encapsulated in one of the containers. A non-transitory computer readable storage medium having a program recorded thereon is provided.

Abstract: A redundant multithreading processor is presented. In one embodiment, the processor performs execution of a thread and its duplicate thread in parallel and determines, when in a redundant multithreading mode, whether or not to synchronize an operation of the thread and an operation of the duplicate thread.

Abstract: A method, computer program product, and computer system for generating a timing sequence for activating resources linked through time dependency relationships. A Direct Acyclic Graph (DAG) includes nodes and directed edges. Each node represents a unique resource and is a predefined Recovery Time Objective (RTO) node or an undefined RTO node. Each directed edge directly connects two nodes and represents a time delay between the two nodes. The nodes are topologically sorted to order the nodes in a dependency sequence of ordered nodes. A corrected RTO is computed for each ordered node after which an estimated RTO is calculated as a calculated RTO for each remaining undefined RTO node. The ordered nodes in the dependency sequence are reordered according to an ascending order of the corrected RTO of the ordered nodes to form a timing sequence for activating the unique resources represented by the multiple nodes.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for transporting a task to a handler, utilizing a queue. These mechanisms and methods for transporting a task to a handler, utilizing a queue can enable improved task management, increased efficiency, dynamic task processing, etc.

Abstract: It is an object of the present invention to provide a program that can simply input dependency of tasks. The first aspect of the invention relates to a program, especially relates to a higher level language. The program requires only inputs regarding tasks and dependency. Then the program may decide all tasks and dependency such that it can schedule all of the tasks with error-free. After all the tasks are scheduled using the dependency determined using the program of the invention. Each task may be executed by means of other programs or hardware.

Abstract: Load information and a first processing time are provided in association with each of a plurality of first time segments that each have a fixed duration time and are included in a first time period, where the load information indicates a load condition of a target computer that executed a target job during the each first time segment, and the first processing time indicates a running time of the target job during the each first time segment. One or more first time segments each having a predetermined analogous relationship with a second time segment in a second time period during which the target job is expected to be executed by the target computer are selected to predict a second processing time indicating a running time of the target job during the second time period based on the first processing times associated with the selected one or more first time segments.

Abstract: An autonomic method, apparatus, and program product are provided for performance data collection. A start time and a stop time are monitored for an application. The start time is compared with the stop time to determine whether or not the application is meeting a performance target of the application. If the application is not meeting the performance target for the application, performance data collection is autonomically started for the application.

Abstract: A system-level management unit generates a system processing and makes a processing request to a task allocation unit of a user-level management unit. The task allocation unit schedules the system processing according to a procedure of an introduced user-level scheduling. A processing unit assigned to execute the system processing sends a notification of acceptability of the system processing to a main processing unit, by halts an application task in appropriate timing or when the processing of the current task is completed. When the notification is received within the time limit for execution, the system-level management unit has the processing unit start the system processing.

Abstract: An exemplary method for scheduling jobs in frames representing views of a geographic information environment is disclosed. An exemplary method includes determining a remaining frame period in a frame representing a view of a geographic information environment. The exemplary method also includes identifying a dynamic job in a scheduling queue. The dynamic job has a non-preemptive section that is between a start of the job and a preemption point of the job. The exemplary method further includes determining an estimated execution time for executing the job. When the estimated execution time is not greater than the remaining frame period, the exemplary method includes executing the non-preemptive section of the job in the frame. When the estimated execution time is greater than the remaining frame period, the exemplary method includes postponing the execution of the job in the frame.

Abstract: A method and system for managing requests among resources within a portable computing device include a scheduler receiving data from a client for scheduling a plurality of requests. Each request identifies at least one resource and a requested deadline. Next, data from the client is stored by the scheduler in a database. The scheduler then determines times and a sequence for processing the requests based on requested deadlines in the requests and based on current states of resources within the portable computing device. The scheduler then communicates the requests to the resources at the determined times and according to the determined sequence. The scheduler, at its discretion, may schedule a request after its requested deadline in response to receiving a new request command from a client. The scheduler may allow a sleep set corresponding to a sleep processor state to power off a processor.

Abstract: Invented systems and methods provide a scalable architecture and hardware logic algorithms for intelligent, realtime load balancing of incoming processing work load among instances of a number of application programs hosted on parallel arrays of manycore processors, which can be dynamically shared among the hosted applications according to incoming processing data load variations for each of the application instances as well as the processing capacity entitlements of the individual applications.

Abstract: A computer program product, apparatus and method for negating initiative for select entries from a shared, strictly FIFO initiative queue in a multi-tasking multi-processor environment. An exemplary embodiment includes a computer program product for negating initiative for select entries from a shared initiative queue in a multi-tasking multi-processor environment, the computer program product including a tangible storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method including identifying an element within the environment that has failed and recovered, not removing the element from the shared initiative queue and entering a boundary element entry into the shared initiative queue.

Abstract: A processing resource apparatus comprises a reference processing module comprising a set of reference stateful elements and a target processing module comprising a set of target stateful elements. A scan chain having a first mode for supporting manufacture testing is also provided, the scan chain being arranged to couple the reference processing module to the target processing module. The scan chain also has a second mode capable of synchronizing the set of target stateful elements with the set of reference stateful elements in response to a synchronization signal.

Abstract: Described are methods and systems related to data report and analysis. A first business intelligence (BI) block is imported to a host analytics user interface (UI). The first BI block includes synchronizable dimensions to synchronize values of the first BI block with other BI blocks, and propagatable dimensions to propagate values of the first BI block to other BI blocks. A host data context of the host analytics UI is updated by propagating the propagatable dimensions of the first BI block. A second BI block is imported to the host analytics UI. The second BI block includes at least one synchronizable dimension in common with at least one propagatable dimension of the first BI block. The synchronizable dimensions of the second BI block are synchronized to the updated host data context. The first BI block and the synchronized second BI block are rendered on the host analytics UI.

Abstract: A request to share visual data from a requester is received. The request is stored on a device configured to share visual data. It is determined whether a communication event indicating that the device is about to communicate with the requester has occurred. The communication event includes an indication that contact information associated with the requester is displayed on the device. In the event that it is determined that a communication event has occurred, a reminder to share visual data associated with the request is indicated.

Abstract: A setup screen not interrupting a management system is displayed in a mobile terminal. A mobile terminal capable of being set up without interrupting a self-management function by detecting a call of a setup screen in a mobile terminal having the self-management function and displaying a virtual setup screen in which setup items interrupting the self-management function are excluded instead of the setup screen, a terminal setup method thereof, and a mobile terminal program thereof are provided.

Abstract: Techniques to manage event notifications are described. An apparatus may comprise a server having an event notification component. The event notification component may have an event agent component to receive a message indicating a change event for line of business (LOB) data, and convert the change event to a defined LOB entity event. The event notification component may have a notification service component to generate a LOB event message for the entity event. The event notification component may have an event database to store the event message in a user event queue. Other embodiments are described and claimed.

Abstract: An embodiment relates generally to a method of updating data. The method includes providing for a plurality of components, where each component is associated with a respective web page. The method also includes providing for a subset of components from the plurality of components, where the subset of components subscribes to an event. The method further includes publishing a notification message in response to the event occurring and retrieving the event by the subset of components.

Abstract: Concepts and technologies are described herein for providing metadata-based eventing supporting operations on data. Application data such as classes and events can be stored in a table and can be associated with and/or described by application metadata. The application metadata also can specify one or more event handlers that reference one or more methods on a class. The event handlers can be invoked via various delegates linked to the one or more application metadata tables. When a create, update, or delete operation on the application data is received, the application metadata can be queried to determine if the application metadata describes event handlers associated with the application data. If event handlers associated with the application data exist, the event handlers can be invoked.

Abstract: If a failure occurs in physical resources constituting a virtual volume, a management server device is notified of information required by a user.

Abstract: The subject disclosure relates to creation and management of component scopes in a computing system. As described herein, an automated scope generation mechanism establishes application modules and their scopes and dependencies in an application-independent manner, hiding the complexity of scope management from the corresponding applications. As additionally described herein, automated scope generation and management techniques can be implemented in the context of a variety of application types, such as document editors and network request processors. Further, techniques are described herein by which a scope manager can implement static checking for scope validity based on scope hierarchy analysis and/or other factors.

Abstract: A computer readable storage medium includes executable instructions to receive input from a user at a first application. The executable instructions include instructions to route the input to a client module, route the input from the client module to a broadcast module and route the input from the broadcast module to a second application. The executable instructions further include instructions to display the input in a first user interface panel associated with the first application and simultaneously display in a second user interface panel associated with the second application information derived from the input.

Abstract: A method, including arranging multiple digital information devices having respective memories to communicate within a network, and assigning within each of a subset of the respective memories a respective memory region dedicated only to management of a respective subgroup of the multiple devices, the subset and the subgroup each having a cardinality of at least two. The multiple digital information devices are then managed by exchanging information stored in the respective memory regions among the digital information devices over the network.

Abstract: A tray locking device adapted to an optical disc drive for locking and releasing a tray is provided. The optical disc drive has an optical head connected to a lead screw and driven to move by the lead screw. The tray locking device includes a pushing member driven to move by the lead screw, a latching hook for locking and releasing a protruding pin, and a transmission assembly configured between the pushing member and the latching hook. The transmission assembly includes a first rod and a second rod movably configured in the tray. The first rod has a first driving portion, and the second rod has a second driving portion. When the transmission assembly is located at an initial position, the first driving portion is located on a moving path of the pushing member, while the second driving portion is not located on the moving path of the pushing member.

Abstract: A disc conveying device includes a route adjuster which is pressed and turned by a disc-shaped recording medium being conveyed in a direction orthogonal to a central axis direction in a lead-in direction of being extracted and led in from a disc cartridge and an ejecting direction of being stored in the disc cartridge after being ejected; wherein a positioning groove is formed to the route adjuster, in which a peripheral portion of the disc-shaped recording medium is inserted at the time of the disc-shaped recording medium being conveyed, so as to position the disc-shaped recording medium.