1. Field of the Invention
This invention relates generally to data processing. More particularly, an embodiment relates to a system and method for performing data processing using shared memory and socket-like communication application programming interface.
2. Description of the Related Art
Traditional client-server systems employ a two-tiered architecture such as that illustrated in
As is known in the art, the “business logic” component of the application represents the core of the application, i.e., the rules governing the underlying business process (or other functionality) provided by the application. The “presentation logic” describes the specific manner in which the results of the business logic are formatted for display on the user interface. The “database” 104 includes data access logic used by the business logic to store and retrieve data.
The limitations of the two-tiered architecture illustrated in
In response to limitations associated with the two-tiered client-server architecture, a multi-tiered architecture has been developed, as illustrated in
This separation of logic components and the user interface provides a more flexible and scalable architecture compared to that provided by the two-tier model. For example, the separation ensures that all clients 125 share a single implementation of business logic 122. If business rules change, changing the current implementation of business logic 122 to a new version may not require updating any client-side program code. In addition, presentation logic 121 may be provided which generates code for a variety of different user interfaces 120, which may be standard browsers such as Internet Explorer® or Netscape Navigator®.
The multi-tiered architecture illustrated in
For example, in a J2EE environment, such as the one illustrated in
In recent years, as business application development projects have grown larger and more diversified, integration of business applications in terms of people, information, and processed is becoming increasingly important. SAP® NetWeaver™ was developed and presented by SAP AG with core capabilities to provide a solution for the integration of people, information, and processes.
However, the integration of people, information, and process is resulting in an ever increasing demand for high-level planning, maintenance, and administration, which in turn, requires the underline architecture and environment to conform to, for example, platform independence, inter-process communication, increased security, development versioning, multi-user possibility, shared memory, and efficient classloading. For example, it would be useful to have an architectural environment that provides increased robustness, improved integration, better monitoring, reduced memory footprint, decreased internal threads, faster session failover, and shared memory.
A system and method are described for performing data processing using shared memory and socket-like application programming interface. In one embodiment, a plurality of handles is employed and associated with a plurality of processes. The plurality of handles may serve as communication end-points for communication of data. Further, an application programming interface is employed to present the plurality of handles as the application programming interface for sockets for facilitating the communication of data compatible with a programming language. The data is communicated between the plurality of processes via the socket-like plurality of handles.
The appended claims set forth the features of the invention with particularity. The embodiments of the invention, together with its advantages, may be best understood from the following detailed description taken in conjunction with the accompanying drawings in which:
Described below is a system and method for employing performing data processing using shared memory and socket-like communication application programming interface. Throughout the description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without some of these specific details. In other instances, well-known structures and devices are shown in block diagram form to avoid obscuring the underlying principles of the present invention.
In the following description, numerous specific details such as logic implementations, opcodes, resource partitioning, resource sharing, and resource duplication implementations, types and interrelationships of system components, and logic partitioning/integration choices may be set forth in order to provide a more thorough understanding of various embodiments of the present invention. It will be appreciated, however, to one skilled in the art that the embodiments of the present invention may be practiced without such specific details, based on the disclosure provided. In other instances, control structures, gate level circuits and full software instruction sequences have not been shown in detail in order not to obscure the invention. Those of ordinary skill in the art, with the included descriptions, will be able to implement appropriate functionality without undue experimentation.
Various embodiments of the present invention will be described below. The various embodiments may be performed by hardware components or may be embodied in machine-executable instructions, which may be used to cause a general-purpose or special-purpose processor or a machine or logic circuits programmed with the instructions to perform the various embodiments. Alternatively, the various embodiments may be performed by a combination of hardware and software.
Various embodiments of the present invention may be provided as a computer program product, which may include a machine-readable medium having stored thereon instructions, which may be used to program a computer (or other electronic devices) to perform a process according to various embodiments of the present invention. A machine-readable storage medium includes floppy diskette, optical disk, compact disk-read-only memory (CD-ROM), magneto-optical disk, read-only memory (ROM), random access memory (RAM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), flash memory. The machine-readable medium may include another type of media/machine-readable medium suitable for storing electronic instructions. Moreover, various embodiments of the present invention may also be downloaded as a computer program product, wherein the program may be transferred from a remote computer to a requesting computer by way of data signals.
Information integration 204 refers to converting information into knowledge quickly and efficiently. Information integration 204 provides efficient business intelligence 216 and knowledge management 220 using SAP products like Business Information Warehouse (BW) and Knowledge Management (KM). Further, consolidation of master data management 218 beyond system boundaries is performed using SAP's Master Data Management (MDM). Process integration 206 refers to optimized process management using integration broker or SAP exchange infrastructure 222 and business process management 224 techniques. Examples of products to perform process integration 206 include Exchange Infrastructure (XI) and Business Process Management (BPM).
Application platform 208 refers to SAP's Web Application Server (Web AS), which is the basis for SAP applications. Web AS, which may be independent of the database and operating system 230, includes a J2EE engine 226 in combination with an already present ABAP engine or instance 228 to further enhance the application platform 208. The architecture 200 further includes a composite application framework 232 to provide various open interfaces (APIs) and a lifecycle management 234, which is an extension of the previous Transport Management System (TMS). As illustrated, the architecture 200 further provides communication with Microsoft .NET 236, International Business Machine® (IBM) WebSphere™ 238, and the like 240.
The Web AS 320 having the ABAP engine 302 is further enhanced by including a J2EE engine 304. The J2EE engine 304 is in communication with the ABAP engine 302 via a fast Remote Function Call (RFC) connection 306. The two engines 302-304 are further in communication with an Internet Communication Manger (ICM) 308. The ICM 308 is provided for handling and distributing queries (e.g., Internet queries) to various individual components of the architecture 300. The architecture 300 further supports a browser 310, such as Microsoft Internet Explorer, Netscape Navigator, and other modified variations of mobile end devices, such as personal digital assistants (PDAs), pocket computers, smart cell phones, other hybrid devices, and the like. The Web AS 320 also supports various protocols and standards 312, such as HyperText Markup Language (HTML), eXtensible Markup Language (XML), Wireless Markup Language (WML), HyperText Transport Protocol (HTTP(S)), Simple Mail Transfer Protocol (SMTP), Web Distributed Authority and Versioning (WebDAV), Simple Object Access Protocol (SOAP), Single Sign-On (SSO), Secure Sockets Layer (SSL), X.509, Unicode, and the like.
The presentation layer 410 serves as an interface between various applications and users or clients 412-416. Here, the clients are illustrated as workstations or terminals 412-416 that are used to collect and gather user input and send it to the application layer 420 via a network connection. The network connection may be a wired or wireless connection to a LAN, a Wide Area Network (WAN), a Metropolitan Area Network (MAN), an intranet, and/or the Internet. The terminals 412-416 include personal computers, notebook computers, personal digital assistants, telephones, and the like. In one embodiment in which the network connection connects to the Internet, one or more of the user terminals 412-416 may include a Web browser (e.g., Internet Explorer or Netscape Navigator) to interface with the Internet.
The presentation layer 410 allows the end user to interact with the relevant application using a GUI, such as the SAP GUI, which is a universal client widely used for accessing SAP R/3 or mySAP functions. The GUI works as a browser and offers easy access to various SAP functions, such as application transactions, reports, and system administration functions. The SAP GUI, for example, is available in three different formats, each of which having its own unique selling point and is suited to a particular user. The three formats include SAP GUI for Windows®, SAP GUI for HTML, and SAP GUI for JAVA.
The presentation layer 410 may also includes various management applications, such as a JAVA Management Extension (JMX)-compliant management application, a JMX manager, and/or a proprietary management application. The management applications include one or more graphical management applications, such as a visual administrator, operating to, for example, retrieve and display information received from the application layer 420 and/or the database layer 430. The visual administrator includes a monitor viewer to display such and other information. The monitor viewer includes a GUI-based or Web-based monitor viewer. Management applications include third party tools, such as file systems, to store information.
The application layer 420 includes various application servers and computing devices to perform data processing. The application layer 420 includes a dispatcher 418, which refers to the central process on the application layer 420 for processing transactions. For example, the dispatcher 422 is used to distribute the request load to individual work processes 424-428, organize communication between the work processes 424-428, and establish connection to the presentation layer 410. For example, when a user makes processing entries from his computer using the menu on the presentation layer 410, the entries are converted into a special format (e.g., GUI protocol) and forwarded to the dispatcher 422. The dispatcher 422 then places this request in a dispatcher queue. The queue is then used to free work processes 424-428 that carry out the processing. The application layer 420 may be implemented in accordance with J2EE v1.3, final release Sep. 24, 2001, published on Jul. 18, 2002 (the J2EE Standard). An update of J2EE v1.3 was recently released, on Nov. 24, 2003, as J2EE v1.4. The management techniques described herein are used to manage resources within a “cluster” of server nodes. However, the underlying principles of the invention are not limited to any particular application server architecture.
The database layer 430 is used to optimize the data access without the being dependent on the underlying database and the operating system. The database independence is achieved using open standards, such as JAVA Database Connectivity (JDC). The presentation layer 410 is where the user interacts with the relevant application, which is then executed at the application layer 420, while the data processing 432-436 is managed at the database layer 430. The database layer 430 may include one or more database management systems (DBMS) and data sources. Furthermore, the database layer 430 is compatible with both the ABAP and J2EE environments and allows the two environments to communicate with each other. For example, the functions of ABAP (e.g., Open SQL for ABAP) are transferred to the functions of J2EE (e.g., Open SQL for JAVA) using a variety of APIs.
The database layer 430 may include one or more database servers, EJB servers, old systems, and mySAP components. The clients at the presentation layer 410 may access one or more of the applications via standalone JAVA programs and programs that help access an application via, for example, using Internet Inter-Object Request Broker Protocol (IIOP)/Common Object Request Broker Architecture (COBRA) written using any number of programming languages (e.g., −C, C, C++, JAVA).
The J2EE environment may also include various J2EE containers that are associated with various J2EE services and APIs, which include JAVA Naming Directory Interface (JNDI), JAVA Database Connectivity (JDBC), J2EE connector Architecture (JCA), Remote Method Invocation (RMI), JAVA Transaction API (JTA), JAVA Transaction Service (JTS), JAVA Message Service (JMS), JAVA Mail, JAVA Cryptography Architecture (JCA), JAVA Cryptography Extension (JCE), and JAVA Authentication and Authorization Service (JAAS). The J2EE services further include EJB_service, serviet_JSP, application_client_service, connector_service to provide (J2EE containers, namely) EJB containers, Web containers, application client containers, and connector containers, respectively.
As illustrated, in a network-based architecture 500, the basic building blocks for communication are the sockets 520-530 associated with each of the processes 502-506. Sockets 520-530 exist within the communication domain, which serves as an abstraction to bundle properties of processes 502-506 communicating through the sockets 520-530. There are various types of sockets 520-530 that communication architectures 500 can adopt. Some examples of the various types of sockets 520-530 include stream sockets, datagram sockets, raw sockets, and sequenced packet sockets. Stream sockets provide bi-directional, reliable, sequenced, unduplicated flow of data. Message boundaries are not visible for stream sockets. Datagram sockets support bi-directional flow of data. Record boundaries are visible for datagram sockets. Raw sockets allow user processes to be used by normal applications. Sequenced packet sockets are similar to stream sockets, with the exception that record boundaries are preserved.
A socket 520-530 is created with a system call and terminated with a system call once a process 502-506 has finished using the socket. The sockets 520-530 are created and maintained on the OS level of the architecture 500. The sockets 520-530 are used to make the inter-process communication similar to file Input/Output (I/O), primarily because the network protocols are typically more complex than conventional I/O devices. Various networks and protocols (e.g., socket interface, TCP/IP) are used to exchange information in a conventional computer system without the use of a shared memory.
A process 502-506 refers to a task being run by a computer, which is often simultaneously with several other tasks. Many of the processes 502-506 exist simultaneously with each of them taking turns on the central processing unit (CPU). Typically, the processes 502-506 include operating system (OS) processes that are embedded in the operating system. The processes 502-506 take up time as opposed to the memory 510-514 that takes up space. This is typically the case for both the processes that are managed by the operating system and those processes that are defined by process calculi. The processes 502-506 further include specialized processes, such as ABAP work processes and J2EE worker nodes.
The operating system works to keep the processes 502-506 separated and allocates the resources to help eliminate the potential interferences of the processes 502-506 with each other when being executed simultaneously. Such potential interferences can cause system failures. Further, the operating system may also provide mechanisms for inter-process communication to enable processes to interact in safe and predictable manner. Typically, an OS process 502-506 consists of memory (e.g., a region of virtual memory for suspended processes), which contains executable code or task-specific data, operating system resources that are allocated to each of the processes which include file descriptor (for UNIX) and handles (for Windows), security attributes (e.g., process owner and the set of permissions), and the processor state (e.g., content of registers, physical memory addresses), which is stored in the actual registers when the process is executing.
The ABAP work processes and the J2EE worker nodes OS processes 502-506 are considered specialized processes that contain the attributes and behavior of the a typical OS process and are created, scheduled, and maintained by the operating system. For example, the ABAP work processes are specialized in that they are used to execute the ABAP-based transactions, and the J2EE worker nodes are specialized in that they are used to execute the JAVA-based transactions.
Having assigned individualized memory 510-514 to each of the processes 502-506 provides a relatively inefficient computing, which lacks robustness as the processes 502-506 do not communicate with each other and have to access the local memory 510-514 for information or data (e.g., an update or a datagram). Furthermore, such network-based communication using various network connections 554-558 also causes the data processing transactions to be time-consuming and less secure. For example, a typical data processing transaction may include retrieving of data from one local memory 510-514, flowing of the data through various protocols (e.g., Transmission Control Protocol (TCP), User Datagram Protocol (UDP)), addresses (e.g., Internet Protocol (IP) address) and operating systems, before reaching its destination at another local memory 510-514.
The processes 602-606 refer to tasks embedded in the operating system. For example, each time a client initiates a program or a document (e.g., opening Microsoft Word®), a request is placed with the operating system regarding commencing the task of opening the document for the client. Several of such processes 602-606 can be performed simultaneously in the CPU by taking turns. Typically, an operating system provides the isolation of such processes 602-606, so they are less likely to interfere with each other, such as when there is a crashed process, such as process 602, none of the other processes, such as processes 604-606, are affected by it and so the potential system failure is avoided. For example, the operating system can increase isolation and robustness by allocating one process 602-606 for each user session, and running a VM for that user session within the allocated process 602-606. However, in some situations (e.g., when there are a large number of user sessions), such operating system scheduling and allocation can add to the system overhead and consume valuable resources, such as time and space.
The processes 602-606 may contain some memory (e.g., a region of virtual memory for suspended processes which contains executable code or task-specific data), operating system resources that are allocated to such processes 602-606 (such as file descriptors, when referring to UNIX, and handles, when referring to Windows), security attributes, such as process owner and the process' set of permissions, and the processor state, such as the content of registers, physical memory addresses, etc.
Various enterprise servers and other large servers are considered request processing engines for processing large numbers of small user requests associated with user sessions. The user requests lead to the creation of processes 602-606, which refer to processing of such user requests. The processing of the requests usually involves the running of a user code (e.g., JAVA servlets or EJBs) in a runtime system (e.g., a JAVA virtual machine (JVM)) executing on a server. In such a server, scalability can be achieved by using multiple threads, such as a multi-threaded VM, to process requests corresponding to a number of user sessions. However, running a large number of user sessions can be relatively cumbersome and wasteful of valuable resources.
In one embodiment, the shared memory 624 can provide a common access and a buffer for the process-attachable VMs, the OS processes 602-606 including ABAP work processes and J2EE worker nodes, as well as dispatcher processes. It is to be noted that the ABAP work processes at the ABAP engine are considered specialized processes that are used for processing the OS processes 602-606 with specialized functionality. The work processes have the attributes and behavior that are also common with the OS processes 602-606 and they may be created, scheduled, and maintained by the operating system. For example, the ABAP work processes are to execute ABAP transactions, while the J2EE worker nodes, also regarded as specialized processes having similar attributes as the processes 602-606, are to execute the JAVA code.
Having introduced the FCA 622 to the architecture 600 facilitates an executable program (e.g., a program running on an OS process 602-606 executing the code) to use the FCA functionalities by binding the FCA library at the time of development and by calling the API for FCA communication in a programming language (e.g., C or JAVA). For example, at runtime, the executable program operates as a process 602-606 in the operating system, such as when a program (e.g., MS Word or Excel) is started several times, which creates several OS processes 602-606 associated with one program that are performed using the FCA functionalities. In one embodiment, the FCA 622 may remain independent of a particular programming language (e.g., ABAP or JAVA) or a particular operating system (e.g., UNIX or Windows). The FCA functionalities may be achieved by coding such functionalities in the program. Stated differently, the program, when running, is executed as an OS process 602-606 and as such it performs various tasks, such as reading/writing data, processing data, and accessing the FCA functionalities.
In one embodiment, having the shared memory 624 helps eliminate the necessity for local memory or individually dispersed memory for performing processes 602-606 and for communicating data. Stated differently, the shared memory 624, as opposed to a local memory using a network connection, is used to create a buffer (e.g., for receiving and transmitting data) for various processes 602-606. A request queue is created at the shared memory 624 and the recently-created request is then placed in the request queue. In one embodiment, the dispatcher then determines the availability of various work processes and, based on such availability, assigns the request to the available work process to handle. The work process performs the corresponding process 602-606 to satisfy the client request. The satisfying of the request may include performing the requested task and providing the requested information or response data back to the client via the shared memory 624. In another embodiment, if the dispatcher is not used, the ICM may possess the functionalities of the dispatcher and assign the request to, for example, the available ABAP work process or J2EE worker node. The ABAP-related requests are sent to the ABAP work processes and the JAVA-related requests are sent to the J2EE worker nodes. Having the shared memory 624 provided by the FCA 622 not only allows a copy-free transmission of the data, but also eliminates the potential of the data being lost due to connection or network failures. Furthermore, using a single shared memory 624 allows the various tasks (e.g., OS processes 602-606) to run on a single local host, which in turn, provides a secure transmission of data. In one embodiment, the shared memory 624 includes memory pipes that are used bi-directionally and are created at startup along with initialization of the FCA 622.
Furthermore, the shared memory 624 at the FCA 622 is low on buffers, which allows for creating and connecting of the queues rather than solely relying on retrying the same queues. Having the shared memory 624 reduces administrative costs, while increasing consistency and easing communication between various processes 602-606. Various entities at the shared memory 624 may include data, datagrams, application update information, strings, constants, and variable.
In one embodiment, the architecture 600 employs FCA handles 610-620 as communication end-points. The handles 610-620 are regarded as an entity at the FCA level for providing communication. Although the handles 610-620 are not sockets as they have different classes, they act socket-like by having similar semantics, which makes application migration from sockets to FCA connections via the handles 610-620 relatively easy. The handles 610-620 are created, maintained, and used at the application layer of the architecture 600 and not necessarily at the OS level where the sockets are created. In one embodiment, the FCA handles 610-620 provide greater performance, reliability, robustness, security, and failover handling, while acting socket-like to ensure low porting effort, high compatibility, and minimal programming effort. The shared memory 624 includes information in blocks to keep track of the number of FCA handles 610-620, buffers, etc. that are being used. Using this information, the FCA 622 can also provide monitoring functionality for monitoring processes and nodes associated with various clients.
The handles 610-620 are associated with one or more processes 602-606 to provide connection to facilitate a link between two processes 602-606. Furthermore, the association of the handles 610-620 with the processes 602-606 is used to an n-tuple that specifies the two endpoints of communication that make up a connection. These functions are based on the client/server model. Further, different handles 610-620 may be used for different purposes.
The server 702 accepts the connection 714 offered by the client 704. Stated differently, the server 702 gets a port and a socket to use for this client 704. The server 702 blocks the connection 716 until connection request from the client 704 is received. The connection is established 720 between the server 702 and the client 704. The client 704 writes the request data 722, which results in sending of the request data 724. The reads the request data 726, which results in receiving of the request data. The request is then processed 728 at the server 702. The server 702 then writes the response data 730, which results in sending of the response data 732 to the client 704. The client 704 then reads the response data 734. The connection may then be closed between the server 702 and this client 704 if no longer necessitated.
At the sever 802, the new connection request from the client is accepted 820; however, the server 802 block any new connections 822 until a new request has arrived. The connection between the client 804 and the server 802 is established 818. The client 804 gets buffer for generating a request 824 and uses the buffer to generate the new request 826. The request is then flushed 828, which results in sending of the request data 830 to the server 802. The server 802 receives the data 832 and processes the request 834.
The server 802 then obtains buffer to generating a response to the request 836 and uses the buffer to generate the response. The response is then flushed 842, which results in sending of the response data 840 to the client 804. The client 804 receives the response data 838 and processes the response 844. The server 802 and this client 804 propose closing the connection 846, 850 when no longer necessitated, and the connection is closed 848.
The server 902 reads 926 the request and receives the request data from the client 904. The request is then processed 928 at the server 902. The server 902 writes 930 the response data and flushes it 932 on to the client 904, which results in sending of the response data 934 to the client 904. The client 904 reads 936 the response data. The response is processed 938 at the client 904. Once the request is processed and the response data is received and there is no longer a need to keep the connection open, the client 904 and server 902 propose closing the connection 940-942, which results in closing of the connection 944.
A JAVA API is provided to allow the handles to work as JAVA-based socket-like endpoints to ease the communication of data between various processes. Stated differently, although the shared memory at the FCA is used to provide bi-directional communication of data between various components, particularly between the processes, the JAVA API provides a socket-like interface for programmers and developers using the JAVA programming language. Similar APIs can be provided for other programming languages, such as a C API may be provided for connection-oriented C FCA (C FCA) communication.
In one embodiment, at the server 1002, the FCA properties (e.g., FCA library) are initialized 1006 to prepare and enable FCA access. A new FCA server is created 1010 which refers to creating a new FCA request queue, which is bound a request queue name. Further, the server 1002 is configured to accept 1014 an open connection from the client 1004. The server 1002 listens for a connection to be made to this FCA request queue and prepares to accept 1014 the connection with it is becomes available. The acceptance is blocked 1016 until a new request has arrived. Meanwhile, at the client 1004, the FCA properties are initialized 1008 for preparation and enablement of FCA access. Further, a new FCA client is created 1012 for a attaching with an existing FCA request queue at the server 1002. At the client 1004, a new connection request is opened 1018, which is used to establish connection 1020 with the request queue at the sever 1002.
A request is then generated 1022 at the client 1018. The request data is written 1024 and then the request is flushed 1026 to send the request data 1028 to the server 1002. The request data is read 1030 and received at the server 1002. The request is then processed 1032. Once the request is processed 1032, the response data is written 1034 and response is flushed 1036, which triggers the sending of the response data 1038 to the client 1004. The client 1004 reads the response data 1040 and processed the response 1042. When the connection is not longer required, the server 1002 and the client 1004 propose closing the connection 1044-1046. The connection is then closed 1048.
In one embodiment, these improvements are achieved by providing a common access to a commonly shared memory using memory pipes 1106 and other necessary layers 1102-1104 and 1108 of the architecture 1100. Such use of the shared memory using the memory pipes 1106 also provides secure and copy-free transfer of data, and decreased network overhead, latency, copy operations, and process switches. Further, to integrate the J2EE engine and the ICM, various protocols, such as RMI, P4, and Telnet, are ported through the ICM, while the shared memory is used as a common access point to transport and communicate data.
In the illustrated embodiment, the architecture 1100 includes a layer of operating system 1102. The operating system 1102 refers to the master control program that runs the computer. The first program is loaded when the computer is turned on, its main part, the kernel, resides in memory at all times. The operating system 1102 sets the standards for all application programs that run on the computer. Further, the applications communicate with the operating system 1102 for user interface and file management operations. Some examples of the operating system 1102 include Windows (e.g., 95, 98, 2000, NT, ME, and XP), Unix (e.g., Solaris and Linux), Macintosh OS, IBM mainframe OS/390, and AS/400's OS/400. Disk Operating System (DOS) is still used for some applications, and there are other special-purpose operating systems as well.
In one embodiment, the semaphores 1104 occupy another layer of the architecture 1100. The semaphores 1104 refer to the shared space for interprocess communications (IPC) controlled by “wake up” and “sleep” commands. For example, the source process fills a queue and goes to sleep until the destination process uses the data and tells the source process to wake up. The semaphores 1104 are provided to work together with the memory pipes 1106, which occupy another layer of the architecture 1100, to facilitate the shared memory. The memory pipes 1106 refer to a fast memory based communication using pipes that are to transport communication data between various components of the architecture 1100.
Using the architecture 1100, these memory pipes 1106 are utilized bi-directionally at the shared memory to relatively efficiently and quickly transport data between various components. The communication between processes and components is facilitated and further enhanced by the FCA communication layer 1108, which include a communication interface or API. The communication layer 1108 works with the semaphores 1104 and the memory pipes 1106 to facilitate direct and bi-directional communication between processes and components and to keep the communication efficient, secure, and fast. Further, the communication layer 1108 works as an API to external inputs, third-party applications, and clients.
In one embodiment, in addition to the layers 1102-1108 described, the FCA 1100 may also include a JAVA FCA layer/API 1112 for JAVA to provide socket-like interface for the Java language. For example, the JFCA layer 1112 is used to provide JAVA-based communication for external applications and to present the FCA handles as socket-like for JAVA. This is also for programmers who use JAVA to make use of the architecture 1100. The JAVA FCA layer/API 1112 is being used here merely as an example and embodiments of the invention are not limited to JAVA. For example, the FCA layer/API 1112 for FCA communication can be used with other programming languages, such as a C-based layer/API for C, a C++-based layer/API for C++, a C#-based layer/API for C#, a VISUAL BASIC-based layer/API for VISUAL BASIC, a JAVA-based layer/API for JAVA, and the like. Regarding handles, the architecture 1100 employs FCA handles as communication end-points, but they are communicated to the programmers as socket-like, which are well-known but are not as efficient as handles, using the JFCA interface layer 1112.
At processing block 1208, the server receives the request data from the client. The request data is then processed at the server at processing block 1210. In processing of the request data, a reply having response data is prepared at the server at processing block 1212. The response data is then sent to the client at processing block 1214. At decision block 1216, a determination is made as to whether additional requests are to be received from this client. If yes, the process continues with the server receiving additional request data at processing block 1208. If not, the connection is not longer necessitated and is closed at processing block 1218.
A hard drive or other storage device 1330 may be used by the system 1300 for storing information and instructions. The storage device 1330 may include a magnetic disk or optical disc and its corresponding drive, flash memory or other nonvolatile memory, or other memory device. Such elements may be combined together or may be separate components. The system 1300 may include a read only memory (ROM) 1335 or other static storage device for storing static information and instructions for the processors 1315 through 1320.
A keyboard or other input device 1340 may be coupled to the bus 1310 for communicating information or command selections to the processors 1315 through 1320. The input device 1340 may include a keyboard, a keypad, a touch-screen and stylus, a voice-activated system, or other input device, or combinations of such devices. The computer may further include a mouse or other cursor control device 1345, which may be a mouse, a trackball, or cursor direction keys to communicate direction information and command selections to the processors and to control cursor movement on a display device. The system 1300 may include a computer display device 1350, such as a cathode ray tube (CRT), liquid crystal display (LCD), or other display technology, to display information to a user. In some environments, the display device may be a touch-screen that is also utilized as at least a part of an input device. In some environments, the computer display device 1350 may be or may include an auditory device, such as a speaker for providing auditory information.
A communication device 1350 may also be coupled to the bus 1310. The communication device 1350 may include a modem, a transceiver, a wireless modem, or other interface device. The system 1300 may be linked to a network or to other device using via an interface 1355, which may include links to the Internet, a local area network, or another environment. The system 1300 may comprise a server that connects to multiple devices. In one embodiment the system 1300 comprises a JAVA® compatible server that is connected to user devices and to external resources.
While the machine-readable medium 1330 is illustrated in an exemplary embodiment to be a single medium, the term “machine-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The term “machine-readable medium” shall also be taken to include any medium that is capable of storing, encoding or carrying a set of instructions for execution by the machine of the system 1300 and that causes the machine to perform any one or more of the methodologies of the present invention. The term “machine-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical and magnetic media, and carrier wave signals.
Furthermore, it is appreciated that a lesser or more equipped computer system than the example described above may be desirable for certain implementations. Therefore, the configuration of system 1300 may vary from implementation to implementation depending upon numerous factors, such as price constraints, performance requirements, technological improvements, and/or other circumstances.
It should be noted that, while the embodiments described herein may be performed under the control of a programmed processor, such as processors 1315 through 1320, in alternative embodiments, the embodiments may be fully or partially implemented by any programmable or hardcoded logic, such as field programmable gate arrays (FPGAs), TTL logic, or application specific integrated circuits (ASICs). Additionally, the embodiments of the present invention may be performed by any combination of programmed general-purpose computer components and/or custom hardware components. Therefore, nothing disclosed herein should be construed as limiting the various embodiments of the present invention to a particular embodiment wherein the recited embodiments may be performed by a specific combination of hardware components.
It should be appreciated that reference throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Therefore, it is emphasized and should be appreciated that two or more references to “an embodiment” or “one embodiment” or “an alternative embodiment” in various portions of this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures or characteristics may be combined as suitable in one or more embodiments of the invention.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure aiding in the understanding of one or more of the various inventive aspects. This method of disclosure, however, is not to be interpreted as reflecting an intention that the claimed invention requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
While certain exemplary embodiments have been described and shown in the accompanying drawings, it is to be understood that such embodiments are merely illustrative of and not restrictive, and that the embodiments of the present invention are not to be limited to specific constructions and arrangements shown and described, since various other modifications may occur to those ordinarily skilled in the art upon studying this disclosure.
Number | Name | Date | Kind |
---|---|---|---|
5331318 | Montgomery | Jul 1994 | A |
5566302 | Khalidi et al. | Oct 1996 | A |
5566315 | Milillo et al. | Oct 1996 | A |
5617570 | Russell et al. | Apr 1997 | A |
5682328 | Roeber et al. | Oct 1997 | A |
5692193 | Jagannathan et al. | Nov 1997 | A |
5710909 | Brown et al. | Jan 1998 | A |
5745778 | Alfieri | Apr 1998 | A |
5805790 | Nota et al. | Sep 1998 | A |
5905868 | Baghai et al. | May 1999 | A |
5909540 | Carter et al. | Jun 1999 | A |
5926834 | Carlson et al. | Jul 1999 | A |
5944781 | Murray | Aug 1999 | A |
5951643 | Shelton et al. | Sep 1999 | A |
5999179 | Kekic et al. | Dec 1999 | A |
6038571 | Numajiri et al. | Mar 2000 | A |
6065006 | deCarmo et al. | May 2000 | A |
6075938 | Bugnion et al. | Jun 2000 | A |
6092171 | Relph | Jul 2000 | A |
6115712 | Islam et al. | Sep 2000 | A |
6115721 | Nagy | Sep 2000 | A |
6167423 | Chopra et al. | Dec 2000 | A |
6199179 | Kauffman et al. | Mar 2001 | B1 |
6216212 | Challenger et al. | Apr 2001 | B1 |
6256712 | Challenger et al. | Jul 2001 | B1 |
6272598 | Arlitt et al. | Aug 2001 | B1 |
6282566 | Lee, Jr. et al. | Aug 2001 | B1 |
6295582 | Spencer | Sep 2001 | B1 |
6330709 | Maynard et al. | Dec 2001 | B1 |
6336170 | Dean et al. | Jan 2002 | B1 |
6345386 | Delo et al. | Feb 2002 | B1 |
6349344 | Sauntry et al. | Feb 2002 | B1 |
6356529 | Zarom | Mar 2002 | B1 |
6356946 | Clegg et al. | Mar 2002 | B1 |
6412045 | DeKoning et al. | Jun 2002 | B1 |
6415364 | Bauman et al. | Jul 2002 | B1 |
6424828 | Collins et al. | Jul 2002 | B1 |
6425057 | Cherkasova et al. | Jul 2002 | B1 |
6438654 | Elko et al. | Aug 2002 | B1 |
6467052 | Kaler et al. | Oct 2002 | B1 |
6519594 | Li | Feb 2003 | B1 |
6553377 | Eschelbeck et al. | Apr 2003 | B1 |
6587937 | Jensen et al. | Jul 2003 | B1 |
6591347 | Tischler et al. | Jul 2003 | B2 |
6601112 | O'Rourke et al. | Jul 2003 | B1 |
6615253 | Bowman-Amuah | Sep 2003 | B1 |
6640244 | Bowman-Amuah | Oct 2003 | B1 |
6643802 | Frost et al. | Nov 2003 | B1 |
6651080 | Liang et al. | Nov 2003 | B1 |
6654948 | Konuru et al. | Nov 2003 | B1 |
6658478 | Singhal et al. | Dec 2003 | B1 |
6681251 | Leymann et al. | Jan 2004 | B1 |
6687702 | Vaitheeswaran et al. | Feb 2004 | B2 |
6738977 | Berry et al. | May 2004 | B1 |
6760911 | Ye | Jul 2004 | B1 |
6766419 | Zahir et al. | Jul 2004 | B1 |
6769022 | DeKoning et al. | Jul 2004 | B1 |
6772409 | Chawla et al. | Aug 2004 | B1 |
6795856 | Bunch | Sep 2004 | B1 |
6799202 | Hankinson et al. | Sep 2004 | B1 |
6829679 | DeSota et al. | Dec 2004 | B2 |
6854114 | Sexton et al. | Feb 2005 | B1 |
6879995 | Chinta et al. | Apr 2005 | B1 |
6970925 | Springmeyer et al. | Nov 2005 | B1 |
7003770 | Pang et al. | Feb 2006 | B1 |
7024512 | Franaszek et al. | Apr 2006 | B1 |
7024695 | Kumar et al. | Apr 2006 | B1 |
7058957 | Nguyen | Jun 2006 | B1 |
7089566 | Johnson | Aug 2006 | B1 |
7124170 | Sibert | Oct 2006 | B1 |
7127472 | Enokida et al. | Oct 2006 | B1 |
7127713 | Davis et al. | Oct 2006 | B2 |
7130891 | Bernardin et al. | Oct 2006 | B2 |
7149741 | Burkey et al. | Dec 2006 | B2 |
7155512 | Lean et al. | Dec 2006 | B2 |
7165239 | Hejlsberg et al. | Jan 2007 | B2 |
7191170 | Ganguly et al. | Mar 2007 | B2 |
7194761 | Champagne | Mar 2007 | B1 |
7203769 | Schnier | Apr 2007 | B2 |
7216160 | Chintalapati et al. | May 2007 | B2 |
7237140 | Nakamura et al. | Jun 2007 | B2 |
7246167 | Kalmuk et al. | Jul 2007 | B2 |
7254634 | Davis et al. | Aug 2007 | B1 |
7296267 | Cota-Robles et al. | Nov 2007 | B2 |
7302423 | De Bellis | Nov 2007 | B2 |
7373647 | Kalmuk et al. | May 2008 | B2 |
7386848 | Cavage et al. | Jun 2008 | B2 |
7395338 | Fujinaga | Jul 2008 | B2 |
20010029520 | Miyazaki et al. | Oct 2001 | A1 |
20020046325 | Cai et al. | Apr 2002 | A1 |
20020049767 | Bennett | Apr 2002 | A1 |
20020052914 | Zalewski et al. | May 2002 | A1 |
20020073283 | Lewis et al. | Jun 2002 | A1 |
20020078060 | Garst et al. | Jun 2002 | A1 |
20020093487 | Rosenberg | Jul 2002 | A1 |
20020099753 | Hardin et al. | Jul 2002 | A1 |
20020129264 | Rowland et al. | Sep 2002 | A1 |
20020133805 | Pugh et al. | Sep 2002 | A1 |
20020147888 | Trevathan | Oct 2002 | A1 |
20020169926 | Pinckney et al. | Nov 2002 | A1 |
20020174097 | Rusch et al. | Nov 2002 | A1 |
20020181307 | Fifield et al. | Dec 2002 | A1 |
20020198953 | O'Rourke et al. | Dec 2002 | A1 |
20030009533 | Shuster | Jan 2003 | A1 |
20030014521 | Elson et al. | Jan 2003 | A1 |
20030014552 | Vaitheeswaran et al. | Jan 2003 | A1 |
20030023827 | Palanca et al. | Jan 2003 | A1 |
20030028671 | Mehta et al. | Feb 2003 | A1 |
20030037178 | Vessey et al. | Feb 2003 | A1 |
20030058880 | Sarkinen et al. | Mar 2003 | A1 |
20030084248 | Gaither et al. | May 2003 | A1 |
20030084251 | Gaither et al. | May 2003 | A1 |
20030088604 | Kuck et al. | May 2003 | A1 |
20030093420 | Ramme | May 2003 | A1 |
20030093487 | Czajkowski et al. | May 2003 | A1 |
20030097360 | McGuire et al. | May 2003 | A1 |
20030105887 | Cox et al. | Jun 2003 | A1 |
20030115190 | Soderstrom et al. | Jun 2003 | A1 |
20030120811 | Hanson et al. | Jun 2003 | A1 |
20030131010 | Redpath | Jul 2003 | A1 |
20030131286 | Kaler et al. | Jul 2003 | A1 |
20030177356 | Abela | Sep 2003 | A1 |
20030177382 | Ofek et al. | Sep 2003 | A1 |
20030187927 | Winchell | Oct 2003 | A1 |
20030191795 | Bernardin et al. | Oct 2003 | A1 |
20030195923 | Bloch et al. | Oct 2003 | A1 |
20030196136 | Haynes et al. | Oct 2003 | A1 |
20030200526 | Arcand | Oct 2003 | A1 |
20030212654 | Harper et al. | Nov 2003 | A1 |
20030229760 | Doyle et al. | Dec 2003 | A1 |
20040003033 | Kamen et al. | Jan 2004 | A1 |
20040024610 | Fradkov et al. | Feb 2004 | A1 |
20040024881 | Elving et al. | Feb 2004 | A1 |
20040024971 | Bogin et al. | Feb 2004 | A1 |
20040045014 | Radhakrishnan | Mar 2004 | A1 |
20040117441 | Liu et al. | Jun 2004 | A1 |
20040128370 | Kortright | Jul 2004 | A1 |
20040167980 | Doyle et al. | Aug 2004 | A1 |
20040168029 | Civlin | Aug 2004 | A1 |
20040181537 | Chawla et al. | Sep 2004 | A1 |
20040187140 | Aigner et al. | Sep 2004 | A1 |
20040205144 | Otake | Oct 2004 | A1 |
20040205299 | Bearden | Oct 2004 | A1 |
20040213172 | Myers et al. | Oct 2004 | A1 |
20040215703 | Song et al. | Oct 2004 | A1 |
20040215883 | Bamford et al. | Oct 2004 | A1 |
20040221285 | Donovan et al. | Nov 2004 | A1 |
20040221294 | Kalmuk et al. | Nov 2004 | A1 |
20050021594 | Bernardin et al. | Jan 2005 | A1 |
20050021917 | Mathur et al. | Jan 2005 | A1 |
20050027943 | Steere et al. | Feb 2005 | A1 |
20050044197 | Lai | Feb 2005 | A1 |
20050044301 | Vasilevsky et al. | Feb 2005 | A1 |
20050055686 | Buban et al. | Mar 2005 | A1 |
20050060704 | Bulson et al. | Mar 2005 | A1 |
20050071459 | Costa-Requena et al. | Mar 2005 | A1 |
20050086656 | Whitlock et al. | Apr 2005 | A1 |
20050086662 | Monnie et al. | Apr 2005 | A1 |
20050125503 | Iyengar et al. | Jun 2005 | A1 |
20050138193 | Encarnacion et al. | Jun 2005 | A1 |
20050160396 | Chadzynski | Jul 2005 | A1 |
20050180429 | Ghahremani et al. | Aug 2005 | A1 |
20050188068 | Kilian | Aug 2005 | A1 |
20050198199 | Dowling | Sep 2005 | A1 |
20050216502 | Kaura et al. | Sep 2005 | A1 |
20050256880 | Nam Koong et al. | Nov 2005 | A1 |
20050262181 | Schmidt et al. | Nov 2005 | A1 |
20050262493 | Schmidt et al. | Nov 2005 | A1 |
20050262512 | Schmidt et al. | Nov 2005 | A1 |
20050268238 | Quang et al. | Dec 2005 | A1 |
20050268294 | Petev et al. | Dec 2005 | A1 |
20050278274 | Kovachka-Dimitrova et al. | Dec 2005 | A1 |
20050278346 | Shang et al. | Dec 2005 | A1 |
20060053112 | Chitkara et al. | Mar 2006 | A1 |
20060053425 | Berkman et al. | Mar 2006 | A1 |
20060059453 | Kuck et al. | Mar 2006 | A1 |
20060064545 | Wintergerst | Mar 2006 | A1 |
20060064549 | Wintergerst | Mar 2006 | A1 |
20060070051 | Kuck et al. | Mar 2006 | A1 |
20060092165 | Abdalla et al. | May 2006 | A1 |
20060094351 | Nowak et al. | May 2006 | A1 |
20060129512 | Braun et al. | Jun 2006 | A1 |
20060129546 | Braun et al. | Jun 2006 | A1 |
20060129981 | Dostert et al. | Jun 2006 | A1 |
20060143328 | Fleischer et al. | Jun 2006 | A1 |
20060143359 | Dostert et al. | Jun 2006 | A1 |
20060143389 | Kilian et al. | Jun 2006 | A1 |
20060143392 | Petev et al. | Jun 2006 | A1 |
20060143609 | Stanev | Jun 2006 | A1 |
20060143618 | Fleischer et al. | Jun 2006 | A1 |
20060143619 | Galchev et al. | Jun 2006 | A1 |
20060150197 | Werner | Jul 2006 | A1 |
20060155867 | Kilian et al. | Jul 2006 | A1 |
20060159197 | Kraut et al. | Jul 2006 | A1 |
20060167980 | Werner | Jul 2006 | A1 |
20060168646 | Werner | Jul 2006 | A1 |
20060168846 | Juan | Aug 2006 | A1 |
20060206856 | Breeden et al. | Sep 2006 | A1 |
20060294253 | Linderman | Dec 2006 | A1 |
20070150586 | Kilian et al. | Jun 2007 | A1 |
20070156907 | Galchev et al. | Jul 2007 | A1 |
20070266305 | Cong et al. | Nov 2007 | A1 |
Number | Date | Country |
---|---|---|
0 459 931 | Dec 1991 | EP |
1380941 | Jan 2004 | EP |
1027796 | Jun 2004 | EP |
2365553 | Feb 2002 | GB |
WO 0023898 | Apr 2000 | WO |
WO03073204 | Sep 2003 | WO |
WO2004038586 | May 2004 | WO |
Number | Date | Country | |
---|---|---|---|
20060129981 A1 | Jun 2006 | US |