text:
|Publication number
|Publication type
|Application number
|Publication date
|Dec 19, 2002
|Filing date
|May 28, 2002
|Priority date
|May 29, 2001
|Publication number
|Raz Gordon, Eyal Aharon
|Original Assignee
|Incepto Ltd.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (5), Referenced by (85), Classifications (8), Legal Events (1)
|External Links: USPTO, USPTO Assignment, Espacenet
[0001] This application claims priority from application number 60/293,548, filed May 29, 2001 and application number 60/333,517, filed Nov. 28, 2001, both by the same inventors.
[0002] 1. Field of the Invention
[0003] The present invention relates to a distributed database clustering method, and in particular, executing the above using asynchronous transactional replication.
[0004] 2. Description of the Related Art
[0005] As information technology increasingly becomes a way to integrate enterprises; a number of trends are reshaping how businesses look at computing resources. An integrated enterprise puts enormous demands on an information system. In this climate, it has become clear that a high-end Enterprise Computing system must be: scalable, to handle unexpected processing demands; available, to provide access to employees, customers and suppliers around the globe 24 hours a day; secure, particularly as more and more business is done over public networks; open, in order to integrate information from multiple sources; flexible, to run a variety of workloads while maintaining service levels; and cost effective.
[0006] The heart of the information system is the database system, and the search for greater efficiency in database processing has led to many alternative database configurations that aim to provide higher availability, greater scalability, faster processing, greater security etc. One of the primary existing database high availability solutions is database clustering. Database clustering refers to the use of two or more servers (sometimes referred to as nodes) that work together, and are typically linked together in order to handle variable workloads or to provide continued operation in the event that a failure occurs. A database cluster typically provides fault tolerance (high availability), which enables the cluster servers to enable continued operation of the cluster in the event that one or more servers fails. In addition, any database cluster is required to retain ACID properties. ACID properties are the basic properties of a database transaction: Atomicity, Consistency, Isolation, and Durability.
[0007] Atomicity requires that the entire sequence of actions must be either completed or aborted. The transaction cannot be partially successful.
[0008] Consistency requires that the transaction takes the resources from one consistent state to another.
[0009] Isolation requires that the transaction's effect is not visible to other transactions until the transaction is committed.
[0010] Durability requires that the changes made by the committed transaction are permanent and must survive system failure.
[0011] Existing database clustering solutions fall into the following categories:
[0012] 1) Shared storage clusters: All cluster database servers are attached to a common storage device (may be a physical disk, SAN storage device, or any other storage system). The database is stored on this shared storage and used by all database servers.
[0013] The main deficiency of shared storage database clusters is that the shared storage is a single point of failure. The common approach of protecting the shared storage is by using storage redundancy technologies such as RAID. Although this provides increased reliability compared to a single disk, it still has a single point of failure (e.g. the RAID controller), and usually cannot protect a computer system against disasters, since all storage devices reside at the same location.
[0014] 2) Storage replication solutions: Duplications of the database are stored on all participating storage servers, which may be located at multiple locations to provide disaster protection. Changes to the database are copied, synchronously (i.e. waiting for all other servers to implement the change) or asynchronously (with no such wait), from the server on which the change took place to the other servers in the group. It should be noted that storage replication by itself only entails duplication of the storage, and in order to provide a high availability solution, some clustering technology is required.
[0015] In the case of synchronous replication, completion of a commit operation (which refers to the saving of a transaction in non-volatile memory so that it is durable) requires a typical synchronous storage replication system to store a new transaction on some or all its sub-devices, in a manner that guarantees the redundancy. In the case of multiple-location redundant storage devices, this method typically requires an expensive, high-speed, low-latency and usually private communication infrastructure, which does not allow the locations to be too far apart, as this would create unacceptable latency. An appropriate communication infrastructure needs to be redundant by itself further raising the price. Single location solutions do not solve the single point of failure as a disaster may destroy the entire site, including the entire redundant storage device.
[0016] In the case of asynchronous replication, typical solutions do not enable database high-availability since they do not provide guaranteed durability of committed database transactions (i.e. they may lose committed database transactions upon failure). Following is a simple example that demonstrates this: let A be the storage server on which a transaction is committed and B be another storage server. Server A processes a client-requested transaction, commits it to its local storage device, and returns an acknowledgement to the client that considers the information as durable in the database (i.e. under no circumstances will the data get lost). The replication engine puts the transaction in a transmission queue, waiting to be sent to server B. Suppose that server A fails at this point in time (after the transaction is locally committed at server A but before it was sent to B). The database at server B does not include the transaction. In such a case either the database cannot be accessed (i.e. no high-availability) or the database continues to be served by B, causing the transaction to be lost. Recovering such a transaction later requires manual intervention. For these reasons, storage replication solutions that use asynchronous replication are not typically suitable for high availability database systems, because they do not provide transaction durability.
[0017] 3) Transactional replication solutions: Duplicates of a database are stored on all participating servers. Any transaction committed to an active server is copied, synchronously (i.e. waiting for all other servers to commit the transaction to their local databases) or asynchronously (with no such wait), from the database server on which the transaction was committed to the other participating servers, at the level of the database server (as opposed to at the storage level). It should likewise be noted that transactional replication by itself only entails duplications of the transactions, and in order to provide a high availability solution, some clustering technology is required. In principal, transactional replication solutions share the same limitations of their storage replication counterparts (see above): synchronous transactional replication suffers from inherent latency and performance problems that grow as the database servers are more distant from each other. Asynchronous transactional replication may result in losses of committed transactions and therefore, by itself, is not suitable for high availability database systems, because it does not guarantee transaction durability.
[0018] Currently available database cluster configurations, while aiming to provide high availability, typically comprise one or more of the following limitations: a single point of failure; no guaranteed transaction durability; no ability to automatically recover from subsequent failures; and an inherent performance degradation of the database server that increases as the distance between cluster servers grows.
[0019] Following is a summary of the capabilities of the various existing technologies:
Shared-disk Synchronous replication Asynchronous replication Function clustering Storage Trans. Storage Trans. Single point of failure Yes No No No No Guaranteed data Yes Yes Yes No No consistency Compliance with Yes Yes Yes No No ACID properties Automatic recovery Yes Yes Yes No No from subsequent failures Inherent performance No Yes Yes No No degradation Price range Medium High High Low Low Applicability for Yes1 Yes2 Yes2 No3 No3 database clustering Product examples4 Microsoft Cluster EMC GeoSpan Oracle DataGuard Veritas volume In all major Server replicator RDBMS Oracle Real CA SurviveIt Application Legato Co- Clusters Standby Server IBM Parallel SysPlex # Legato (Legato Systems, Inc., Mountain View, CA, www.legato.com)
[0020] U.S. Pat. No. 5,956,489, of San Andres, et al., which is fully incorporated herein by reference, as if fully set forth herein, describes a transaction replication system and method for supporting replicated transaction-based services. This service receives update transactions from individual application servers, and forwards the update transactions for processing to all application servers that run the same service application, thereby enabling each application server to maintain a replicated copy of service content data. Upon receiving an update transaction, the application servers perform the specified update, and asynchronously report back to the transaction replication service on the "success" or "failure" of the transaction. When inconsistent transaction results are reported by different application servers, the transaction replication service uses a voting scheme to decide which application servers are to be deemed "consistent," and takes inconsistent application servers off-line for maintenance. Each update transaction replicated by the transaction replication service is stored in a transaction log. When a new application server is brought on-line, previously dispatched update transactions stored in the transaction log are dispatched in sequence to the new server to bring the new server's content data up-to-date. The '489 invention's purpose is to maintain an array of synchronized servers. It is targeted at content distribution and does not provide high availability. The essence of this invention is the distribution service that acts as a synchronization point for the entire array of servers. As such, however, it must be a single service (one to many relation between the service and the array servers), which makes it a single point of failure. Therefore, the entire system described in the patent cannot be considered a high availability system.
[0021] U.S. Pat. No. 6,014,669, of Slaughter, et al., which is fully incorporated herein by reference, as if fully set forth herein, describes a highly available distributed cluster configuration database. This invention includes a distributed configuration database wherein a consistent copy of the configuration database is maintained on each active node of the cluster. Each node in the cluster maintains its own copy of the configuration database, and configuration database operations can be performed from any node. The consistency of each individual copy of the configuration database can be verified from the consistency record. Additionally, the cluster configuration database uses a two-phase commit protocol to guarantee that the copies of the configuration database are consistent among the nodes. This invention, although not a replication technology per se, shares the deficiencies of category 3 above (synchronous transactional replication), and likewise suffers from inherent latency and performance problems that grow as the database servers are more distant from each other. The global locking mechanism of the '669 patent implements single writer/multiple reader and therefore is conceptually identical to synchronous storage replication, in that it stalls the entire database cluster operation until the writer completes the write operation.
[0022] The above products usually present only partial solutions to database high availability needs. These often expose the user to risks of downtime and even lost transactions and critical data. There is thus a widely recognized need for, and it would be highly advantageous to have, an integrated approach that ensures high availability of databases, while maintaining data and transaction consistency, integrity and durability. There is also a need for such an approach to provide disaster tolerance, by spanning the cluster over distant geographical locations. Without all these elements, critical databases are vulnerable to unacceptable downtime, loss of data and/or degraded performance.
[0023] According to the present invention there is a method for enabling a distributed database clustering system, posing no limitation on the distance between cluster nodes while inducing no inherent performance degradation of the database server, that can enable high availability of databases, while maintaining data and transaction consistency, integrity, durability and fault tolerance. This is achieved by utilizing, as a building block, asynchronous transactional replication.
[0024] A database server cluster is a group of database servers behaving as a single database server from the point of view of clients outside the group. The cluster servers are coordinated and provide continuous backup for each other, creating a fault-tolerant server from the client's perspective.
[0025] The present invention provides technology for creating distributed database clusters. This technology is based on three main modules: Master Election, Database Grid and Cluster Commit. Master Election continuously monitors the cluster and selects the active server. Database Grid is responsible for asynchronously replicating any changes to the database of the active server to the other servers in the clusters. Since this replication is asynchronous it suffers from the same problems that make asynchronous replication inadequate for clustering databases (mentioned in section 2 above). Cluster Commit overcomes these limitations and ensures durability of cluster-committed transactions in the cluster. I.e. no recoverable failure of individual servers in the cluster, or of the entire cluster, will destroy cluster-committed transactions. In addition, as long as the cluster is operational, the state of the database, as exposed by the cluster as a whole, will be identical to the state of the database after the committing of all these transactions.
[0026] It is important to note that the active database server in a cluster may continue processing transactions normally (additional transactions from additional applications), while the cluster commit operation is in progress. During this entire process, normal database performance is maintained. In this way, the advantages of both synchronous and asynchronous transactions are maintained, providing data processing efficiency and transaction durability.
[0027] The principles and operation of a method according to the present invention may be better understood with reference to the drawings, and the following description it being understood that these drawings are given for illustrative purposes only and are not meant to be limiting, wherein:
[0028]FIG. 1 is an illustration of the architecture of a distributed database grid, according to the present invention.
[0029]FIG. 2 is an illustration of the initial setup of the Cluster Commit software.
[0030]FIG. 3 is an illustration of the CoIP software (which is an example of an implementation of the present invention) creating copies of the installed databases.
[0031]FIG. 4 is an illustration of the CoIP software maintaining the databases continuously synchronized.
[0032]FIG. 5 is an illustration of the CoIP software executing fail-over to server B upon failure in server A.
[0033]FIG. 6 is an illustration of the CoIP software executing recovery from the server A failure.
[0034]FIG. 7 is an illustration of the CoIP software executing resumption of normal operation.
[0035] The present invention relates to a method for enabling distributed database clustering that provides high availability of database resources, while maintaining data and transaction consistency, integrity, durability and fault tolerance, with no single point of failure, no limitations of distance between cluster servers, and no inherent degradation of database server performance.
[0036] The following description is presented to enable one of ordinary skill in the art to make and use the invention as provided in the context of a particular application and its requirements. Various modifications to the preferred embodiment will be apparent to those with skill in the art, and the general principles defined herein may be applied to other embodiments. Therefore, the present invention is not intended to be limited to the particular embodiments shown and described, but is to be accorded the widest scope consistent with the principles and novel features herein disclosed.
[0037] Specifically, the present invention provides a method for creating database clusters using asynchronous transactional replication as the building block for propagating database updates in a cluster. The essence of the present invention is to add guaranteed durability to such an asynchronous data distribution setup. The present invention therefore results in a database cluster that combines the advantages of synchronous and asynchronous replication systems, while eliminating their respective deficiencies. Such a database cluster is therefore superior to database clusters configured on top of either single-location or multiple-location (distributed) storage systems.
[0038] According to the present invention, a plurality of servers is grouped together to form a database cluster. Such a cluster is comprised of a group of computers interconnected by network connections only that share no other resources. According to the present invention, there are no restrictions on the type of the network used. However, the network must have a "backbone", which is a point or segment of the network to which all cluster nodes are connected, and through which they converse with each other. No alternative routes, which bypass the backbone, may exist. The backbone itself needs to be fault-tolerant as it would otherwise be a single point of failure of the distributed cluster. This backbone redundancy may be achieved using networking equipment supporting well-known redundancy standards such as IEEE 802.1D (spanning tree protocol). There is no restriction on the distance between the cluster computers. In order to allow proper operation and avoid network congestions, the network bandwidth between any pair of cluster computers should be able to accommodate data transfers required by the asynchronous replication scheme, described below.
[0039] Each server within the database cluster exchanges messages periodically with each other server. These messages are configured to carry data such as the up-to-date status of a server and the server's local primary database version (DB(k,k) for server k, as defined in the following section. In this way, all cluster servers are aware of each other's existence (absence is detected by the fact that messages are not received from the server), status and database version.
[0040] The technology of the present invention achieves its functional goals by combining three primary techniques:
[0041] 1. A Database Grid technique for generating and maintaining multiple copies of the database on a plurality of servers in a cluster.
[0042] 2. A Cluster Commit technique for maintaining transaction durability.
[0043] 3. A master election component for dynamically deciding which of the cluster nodes is the active node (the node which is in charge of processing update transactions).
[0044] Database Grid (DG) Technique
[0045] Any technique for enabling generating and maintaining of multiple copies of a database on a plurality of servers in a cluster, using asynchronous transactional replication as a building block, may be used. An example of such a technique, which continuously performs the above, is as follows:
[0046] Let N be the number of servers in a cluster, indexed from 1 to N. DG starts with a single database that needs to be clustered. The database should reside on one of the cluster servers, which may be referred to as the "Origin" server. As can be seen in FIG. 1: Let this be server 1. Let the database be DB(1,1).
[0047] DG duplicates the database, creating an N by N matrix of databases DB(1 . . . N, 1 . . . N) that are exact copies of the original database. DB(k, 1) . . . DB(k, N) [DB(1,1) . . . DB(1,3) in FIG. 1 ] are local to server k [server 1], for each 1<=k<=N. DB(k,k) [DB(1,1) in the Figure] is the local primary database of server k—the database into which transactions are applied when k becomes the active server of the cluster. Modification transactions are not allowed into the database during the duplication process (this holds for any DG technique being used).
[0048] DG then creates a set of one-way asynchronous replication links between the various databases residing on the different servers in the cluster, in order to allow changes in the "active" database (see below) to propagate to all of the matrix databases. The replication links are illustrated by the arrow lines in the Figure. There are two types of replication links: "static" and "local".
[0049] Static replications are represented in the Figure by horizontal lines 11 connecting primary databases to other (replica) databases. These static replications are of the form DB(k,k) →DB(j,k), where 1<=k,j <=N and k≠j. I.e. This process entails replication of the primary database of server k to any other replica databases in the cluster (a replica database is maintained for every primary database, on each server in the cluster). Static replications are active at all times.
[0050] Local replications are represented in the Figure by vertical lines 12 connecting replica databases to primary databases on each server in the cluster. These local replications are of the form DB(k,a)→DB(k,k)[DB(1,2) . . . DB(1,1) in FIG. 1], where a is the index of the active cluster server. Local replications are deployed on any server k, where k≠a. Local replications are added and removed to accurately reflect this rule whenever the active cluster server is changed. Notice that DB(k,a) is in-sync (synchronized) with DB(a,a)[DB(2,2) in the Figure] since the static replication DB(a,a) →DB(k,a) is always in-place (DB(k,a) is the replica of the active server's primary database on the inactive server k). However, when building a local replication DB(k,a) →DB(k,k) on-the-fly, transactions that have been added recently to DB(k,a) may not exist in DB(k,k). Therefore, a synchronization of databases prior to the activation of the local replication is required. This synchronization makes DB(k,k) identical to DB(k,a). In order to perform this synchronization with no race problems when updating the database, the DB(a,a)→DB(k,a) static replication may be suspended for the duration of the synchronization. It should be resumed after the local replication is activated. This causes all pending transactions (that were applied to DB(a,a) while the replication was suspended) to be copied through the replication pipes.
[0051] Cluster Commit Technique
[0052] The Database Grid technology creates asynchronous replication paths for ensuring that transactions, committed to the active database DB(a,a), will eventually be replicated to all databases in the grid. However, DG alone does not guarantee that committed transactions will survive a failure (the transaction durability property is not preserved), as replication takes place after the transaction is committed in the active server. Any failure between the commit time to the active server (as of before the failure) and the time the transaction is fully replicated to the server that becomes active after the failure will cause the transaction to be lost. Moreover, it is easy to see that the dynamic creation of local replications will cause this transaction to be effectively rolled back as all databases in the grid are synchronized to reflect the content of the active server's database, which does not contain the transaction.
[0053] Clearly, the above scenario would have been a violation of the Durability requirement, specified in the ACID properties. The cluster commit technology provides a solution for this problem.
[0054] Cluster Commit is an element that clearly distinguishes the present invention from all other known high availability solutions based on asynchronous replication. Cluster Commit, in contrast to other known technologies, guarantees durability of committed transactions in the cluster. Due to the strict requirement for full ACID compliance set by all database systems, this capability makes the present invention the only high availability solution based on asynchronous replication suitable for use with database systems.
[0055] Successful Cluster Commit (CC) ensures that all transactions, locally committed to the active server prior to the execution of the cluster commit operation, are durable in the cluster. I.e. no recoverable failure of any of servers in the cluster, or of the entire cluster, will destroy these transactions. In addition, as long as the cluster is operational, the state of the database, as exposed by the cluster as a whole, will be identical to the state of the database after all of these transactions have been committed.
[0056] The Cluster Commit technology comprises several mechanisms:
[0057] 1. Availability monitor: this mechanism is executed on the active server (the server on which transactions are currently being executed), and continuously updates a list of 'Available Servers'. An Available Server is a functional cluster server (i.e. has no error conditions) that responds 'quickly enough' to database version updating (see below). Specifically, the monitor scans active servers that are "Unavailable" for their version number, and puts them back into an "Available" state whenever this version number matches the version number of the Active Server.
[0058] 2. Cluster Commit operation (database versioning): a special table, used exclusively by the cluster commit mechanism, is added to the origin database before the database grid is constructed (a similar table is added to all the databases that are later added to the cluster). This table stores the database version number. The Cluster Commit operation performs a transaction that increments this version number on the active server. The active server then waits for this transaction to be committed at all Available Servers (each target server responds with a special message whenever a new version number is detected in the special table of its local primary database—which is the database that receives application commands when it is running on the active server). Since transactional replication is a first-in-first-out mechanism, the commit of this transaction to the remote server's primary database ensures that all previous transactions (transactions committed prior to the database version transaction) are committed to the remote server's primary database as well. Any of the Available Servers not responding 'quickly enough' are marked as "Unavailable", removing it from the list of servers that the cluster commit operation waits for. The operation is successfully completed when all Available Servers have responded.
[0059] It is important to note that the active database server may continue processing transactions normally (additional transactions from additional applications), while the cluster commit operation is in progress. During this entire process, normal database performance is maintained.
[0060] 3. Cold-Start state: this state is a local state for any of the servers in a cluster. It is entered whenever a cluster server suffers a failure that does not allow the particular server to continue receiving database updates from other servers in the cluster. Examples of such failures are server failures, server shutdowns or server disconnections (from the backbone) etc. When the server recovers after such a failure, it enters a 'cold start' state, in which it needs to collect more information for deciding which server should be the active cluster server. If there is a current active server, the cold-starting server resumes normal operation immediately. This is necessary in order to avoid the potential damage of selecting a server with a database version that is not up-to-date.
[0061] In order to exit a cold-start state, a server must:
[0062] a. receive a periodic message from the active cluster server.
[0063] b. If no active server exists (e.g. when all other cluster servers are in cold-start), the server waits to receive messages from all cluster servers, in order to conclude which has the latest database version. The one having the latest database version is elected as the candidate to be the active server.
[0064] Master Election Component
[0065] The master election component determines, on a continuous basis, which cluster server is the active server candidate (the server that should be the active server), based, among other parameters, on the database version of the primary database of the server. When the candidate is different from the actual (current) active server, a fail-over process takes place, wherein the active node, when realizing that it is not the candidate, relinquishes its active state. When the candidate recognizes that no active node exists in the cluster, the candidate executes a take-over procedure, thereby making itself the active node.
[0066] The algorithm of this component, which is used to determine the above, is arbitrary and not directly related to the present invention. However, the algorithm must comply with the following constraints:
[0067] 1. A node with an error condition preventing it from communicating with the backbone is never selected to be the active node candidate.
[0068] 2. An unavailable node is never selected to be the active node candidate.
[0069] 3. A cold-starting node is not selected to be the active node candidate unless all other cluster nodes are in cold start state and the node has the latest version of the database.
[0070] A preferred embodiment of the present invention utilizes the above-described mechanisms to provide high-availability for databases, even when hardware, software or communication problems of some predefined degree happen. This embodiment is provided in the form of software for building distributed database clusters. The clustering software is installed on each database server participating in the cluster. At the user's command, a database is added to the cluster. This causes the Database Grid for this database to be established. When this is done, an active server is elected and the database is continuously available to client computers as long as at least one database server in the cluster has none of the above problems and can serve the database.
[0071] In order to operate the invention the following steps are performed:
[0072] 1. The software that implements the invention is installed on the database servers that need to be clustered.
[0073] 2. The servers are connected to a network, over a TCP/IP connection. Network security policies are configured so that the each clustered server can access the other clustered servers, and such that transactional replication links can be deployed.
[0074] 3. The clustered database (or databases) is installed on one of the clustered servers (defined as the "Origin server").
[0075] 4. The Database Grid (DG) function is executed. The DG creates copies of the selected origin server's databases on the other servers in the cluster. Transactional replication links are established between the clustered databases.
[0076] 5. The Master Election process is started and constantly determines which server is the active server.
[0077] 6. The Cluster Commit function is called by the applications that drive transactions to the database (the 'database application'). The Cluster Commit function guarantees that the current consistent state of the active node's version of the database is durable in all cluster nodes. The Cluster Commit function does not stall the operation of the database server.
[0078] 7. In case of a failure in the active node, another server in the cluster becomes Active. This may result in a momentary loss of database connection for some or all of the applications that are connected to the clustered database. However, the application is typically able to recover from such a situation.
[0079] 8. At this stage the database application can be started and transactions can be sent to the database cluster.
[0080] The principles and operation of a system and a method according to the present invention may be better understood with reference to the drawings and the accompanying description, it being understood that these drawings are given for illustrative purposes only and are not meant to be limiting, wherein:
[0081] An example of the implementation of the Invention can be seen in FIGS. 2-7. The software of the present invention, as described above, is hereinafter referred to as "Cluster Over IP (CoIP)" software.
[0082]FIG. 2 shows a simple example of the initial state of CoIP cluster installation. A simple cluster configuration may consist of two servers, Server 1 and Server 2. The software of the present invention (CoIP) forms from these servers a distributed database cluster using transactional replication. The CoIP manages the servers and databases, directing traffic only to those databases that are correctly servicing application requests.
[0083] Initially, databases are installed on the Origin server (the active server) using standard procedures. At least one separate database (e.g. DB1,DB2) may be installed on each server, to gain enhanced performance. Databases may be installed prior to the installation of the CoIP or after. The CoIP is subsequently installed on each participating server.
[0084] The CoIP creates copies of the installed databases and creates the above-described database grid technology (see FIG. 3). CoIP keeps the databases continuously synchronized, using its database grid function (described above).
[0085] The Master election process constantly selects the "Active server", i.e. the server in the cluster to which transactions will be assigned.
[0086] The administrator defines the CoIP instances and a virtual IP address for each instance (IP-A and IP-B for DB1 and DB2 in FIG. 3).
[0087] The database application is configured to connect to the related cluster Virtual IP addresses (Virtual IP-A for DB1 and Virtual IP-B for DB2 in FIG. 4).
[0088] Transactions committed using the cluster commit mechanism are fed by an instructing application into the active database (on the active cluster server).
[0089] If a server or application failure is detected by the CoIP, the master election process selects another server in the cluster to become the active node, by assigning the relevant virtual IP address to the selected server. In the example provided in FIG. 5, server B assumes Virtual IP-A to overcome a failure in server A (black circles mark the changed items compared to normal operation).
[0090] Transactions that continue to be sent to the same virtual IP address now arrive at the new active server (server B in the example in FIG. 5).
[0091] Since all databases on the new active server are already synchronized, fail-over time is minimal. Transactions are logged and kept on the active server until the failed server recovers, thereby ensuring quick recovery, data coherency and no loss of data. These results are a function of the database grid and cluster commit techniques described above.
[0092] When the failed server recovers (the event is identified by the CoIP software), logged transactions on the current active server are sent to the databases in the recovering server (See FIG. 6).
[0093] Databases on the recovering server are synchronized to those on the active server. Transactions continue to arrive at the active server (server B in the example) until all databases on the origin server (server A in the example) are fully synchronized. The synchronization process is transparent to the user and the application, since the active server continuously handles transactions. Therefore, from the application's standpoint, the database is fully operational at any time during this process.
[0094] Once all databases are synchronized, the master election process may select a new active server (typically the Origin server), which assumes the relevant virtual IP address. FIG. 7 shows the last phase of the recovery process, wherein the Origin server once again becomes the active server.
[0095] According to an additional embodiment of the present invention, a method is provided for enabling effective load balancing within distributed database clusters. Load balancing refers to distributing the processing of database requests across the available servers. According to this embodiment, transactions involving modifications to the database are always processed by the active server. Furthermore, read-only transactions are either processed by the active server or directed to any of the inactive, available servers, for processing, using arbitrary decision riles. An example for such a rule is randomly selecting a server among currently available servers, which creates uniform load balancing of read requests. Other load-balancing schemes may be implemented using other decision rules. However any set of decision rules that are used must never select an unavailable server for processing read requests. As long as this constraint is preserved, read transactions will access consistent, up-to-date versions of the database at all times, since the Cluster Commit mechanism guarantees that committed transactions are present at all available server databases before the Cluster Commit operation successfully completes.
[0096] Being a distributed database clustering technology, the present invention is superior to known shared-storage technologies, in that it has no single point of failure.
[0097] The inherent limitations of existing technologies make creation of distributed database clusters (i.e. such clusters that comply with transaction ACID properties) very expensive in some cases (multiple locations with high-bandwidth, low-latency interconnection) and impossible in others (multiple locations too far apart to provide the required latency). The present invention allows the creation of distributed database clusters with no latency constraints, allowing deployment of distributed clusters over virtually any network. This enables distributed configurations that are virtually impossible today, and lowers the cost for those that could be implemented using distributed storage techniques. Furthermore, distributed database clusters allow companies to protect their business-critical databases against all types of failures, such as server crashes, network failures or even when an entire site goes down.
[0098] The technology according to the present invention is the first known technology that utilizes asynchronous replication that complies with the durability requirement of database servers. An innovative technology is hereby provided for database clustering built on top of asynchronous replication. Furthermore, the technology of the present invention enables building an affordable database disaster protection system through the distributed database cluster.
[0099] Asynchronous replication systems and transactional durability are virtually contradicting constraints, and it is virtually impossible to achieve the combination of the two using existing technologies. The present invention provides a method for enabling an asynchronous replication system combined with transactional durability.
[0100] The foregoing description of the embodiments of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. It should be appreciated that many modifications and variations are possible in light of the above teaching. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto.
|Cited Patent
|Filing date
|Publication date
|May 4, 1936
|Mar 28, 1939
|American Box Board Co
|Title not available
|Title not available
|Title not available
|Title not available
|Citing Patent
|Filing date
|Publication date
|Sep 28, 2001
|May 2, 2006
|Oracle Corporation
|Techniques for adding a master in a distributed database without suspending database operations at extant master sites
|Dec 27, 2004
|Jul 18, 2006
|Oracle International Corporation
|Dynamic remastering for a subset of nodes in a cluster environment
|Sep 29, 2003
|Nov 7, 2006
|International Business Machines Corporation
|Method, system, and program for forming a consistency group
|Mar 4, 2002
|Apr 3, 2007
|Oracle International Corp.
|Methods to perform disk writes in a distributed shared disk system needing consistency across failures
|Aug 19, 2002
|Jun 19, 2007
|Juniper Networks, Inc.
|Private configuration of network devices
|Feb 17, 2005
|Jun 17, 2008
|Oracle International Corporation
|Remastering for asymmetric clusters in high-load scenarios
|Aug 12, 2004
|Aug 19, 2008
|Oracle International Corporation
|Extensible framework for transferring session state
|Aug 12, 2004
|Oct 14, 2008
|Oracle International Corporation
|Calculation of service performance grades in a multi-node environment that hosts the services
|Aug 12, 2004
|Oct 14, 2008
|Oracle International Corporation
|Service placement for enforcing performance and availability levels in a multi-node system
|Aug 12, 2004
|Oct 21, 2008
|Oracle International Corporation
|On demand node and server instance allocation and de-allocation
|Jan 9, 2003
|Jan 27, 2009
|Juniper Networks, Inc.
|Generation of a configuration patch for network devices
|Jun 16, 2004
|Mar 10, 2009
|Solid Information Technology Oy
|Arrangement and method for optimizing performance and data safety in a highly available database system
|May 1, 2006
|Mar 10, 2009
|Oracle International Corporation
|Database shutdown with session migration
|Aug 12, 2004
|Apr 7, 2009
|Oracle International Corporation
|Hierarchical management of the dynamic allocation of resources in a multi-node system
|Jul 28, 2004
|May 19, 2009
|Oracle International Corporation
|Methods and systems for validating a system environment
|Aug 12, 2004
|Jun 23, 2009
|Oracle International Corporation
|Incremental run-time session balancing in a multi-node system
|Aug 12, 2004
|Jun 23, 2009
|Oracle International Corporation
|Transparent session migration across servers
|Mar 17, 2003
|Jul 7, 2009
|Juniper Networks, Inc.
|Application of a configuration patch to a network device
|Aug 12, 2004
|Feb 16, 2010
|Oracle International Corporation
|Managing workload by service
|Dec 20, 2004
|Mar 16, 2010
|International Business Machines Corporation
|Apparatus, system, and method for database provisioning
|Sep 6, 2006
|Jun 8, 2010
|International Business Machines Corporation
|Method, system and program for forming a consistency group
|Aug 12, 2004
|Jun 29, 2010
|Oracle International Corporation
|Transparent migration of stateless sessions across servers
|Mar 1, 2006
|Sep 21, 2010
|Oracle International Corporation
|Techniques for replicating groups of database objects
|Apr 24, 2007
|Dec 14, 2010
|Oracle International Corporation
|Methods, systems and software for identifying and managing database work
|Nov 20, 2006
|Jan 4, 2011
|Juniper Networks, Inc.
|Generation of a configuration patch for network devices
|Feb 20, 2007
|Apr 19, 2011
|Oracle International Corporation
|Methods to perform disk writes in a distributed shared disk system needing consistency across failures
|Dec 18, 2008
|Apr 19, 2011
|Oracle International Corporation
|Incremental run-time session balancing in a multi-node system
|Mar 29, 2005
|May 3, 2011
|Network Equipment Technologies, Inc.
|Replication of static and dynamic databases in network devices
|Jul 28, 2004
|May 3, 2011
|Oracle International Corporation
|Methods and systems for modifying nodes in a cluster environment
|Aug 12, 2004
|May 31, 2011
|Oracle International Corporation
|Fast reorganization of connections in response to an event in a clustered computing system
|Apr 23, 2007
|Jun 14, 2011
|Oracle International Corporation
|Automated treatment of system and application validation failures
|Nov 2, 2007
|Aug 23, 2011
|Vmware, Inc.
|Data replication method
|Sep 14, 2009
|Feb 28, 2012
|Robert Edward Wagner
|Automated method for identifying and repairing logical data discrepancies between database replicas in a database cluster
|Apr 5, 2011
|May 15, 2012
|Vmware, Inc.
|Data replication method
|Aug 31, 2007
|Jun 5, 2012
|International Business Machines Corporation
|Fail over resource manager access in a content management system
|Sep 8, 2006
|Jun 19, 2012
|Oracle International Corporation
|Insertion rate aware b-tree
|Jul 8, 2005
|Jul 17, 2012
|Sap Ag
|Data processing system and method for iteratively re-distributing objects across all or a minimum number of processing units
|Jun 19, 2008
|Jul 31, 2012
|Microsoft Corporation
|Third tier transactional commit for asynchronous replication
|Mar 18, 2011
|Dec 4, 2012
|Microsoft Corporation
|Seamless upgrades in a distributed database system
|Aug 12, 2004
|Jan 29, 2013
|Oracle International Corporation
|Recoverable asynchronous message driven processing in a multi-node system
|Sep 21, 2010
|Jun 4, 2013
|Oracle International Corporation
|Continuous system health indicator for managing computer system alerts
|Nov 5, 2009
|Aug 13, 2013
|Oracle International Corporation
|Lock manager on disk
|Apr 16, 2007
|Feb 25, 2014
|Universal game server
|Dec 21, 2012
|Oct 7, 2014
|International Business Machines Corporation
|Consistent replication of transactional updates
|Feb 22, 2008
|Oct 7, 2014
|Open Invention Network, Llc
|Method and apparatus for sequencing transactions globally in distributed database cluster
|Jun 18, 2012
|Jan 20, 2015
|Comcast Ip Holdings I, Llc
|Method for accessing service resource items that are for use in a telecommunications system
|Oct 5, 2012
|Apr 7, 2015
|Google Inc.
|Database replication
|Apr 17, 2007
|May 5, 2015
|Oracle International Corporation
|Real-time database exception monitoring tool using instance eviction data
|Feb 19, 2009
|Sep 8, 2015
|Oracle International Corporation
|Intelligent flood control management
|Mar 4, 2002
|Jul 18, 2002
|Sashikanth Chandrasekaran
|Methods to perform disk writes in a distributed shared disk system needing consistency across failures
|Feb 13, 2004
|Oct 14, 2004
|International Business Machines Corporation
|Method for operating a computer cluster
|Apr 11, 2003
|Oct 28, 2004
|Jonathan Maron
|System and method for a configuration repository
|Jan 16, 2003
|Feb 10, 2005
|Jardin Cary Anthony
|System and method for distributed database processing in a clustered environment
|Aug 12, 2004
|Feb 17, 2005
|Oracle International Corporation
|Calculation of sevice performance grades in a multi-node environment that hosts the services
|Aug 12, 2004
|Feb 17, 2005
|Oracle International Corporation
|Fast reorganization of connections in response to an event in a clustered computing system
|Aug 12, 2004
|Feb 17, 2005
|Oracle International Corporation
|Transparent migration of stateless sessions across servers
|Aug 12, 2004
|Feb 17, 2005
|Oracle International Corporation
|Service placement for enforcing performance and availability levels in a multi-node system
|Aug 12, 2004
|Feb 17, 2005
|Oracle International Corporation
|Hierarchical management of the dynamic allocation of resources in a multi-node system
|Aug 12, 2004
|Feb 17, 2005
|Oracle International Corporation
|Transparent session migration across servers
|Aug 12, 2004
|Feb 17, 2005
|Oracle International Corporation
|Extensible framework for transferring session state
|Aug 12, 2004
|Mar 10, 2005
|Oracle International Corporation
|Incremental run-time session balancing in a multi-node system
|Sep 29, 2003
|Mar 31, 2005
|Spear Gail Andrea
|Method, system, and program for forming a consistency group
|Feb 17, 2005
|Jul 7, 2005
|Chan Wilson W.S.
|Remastering for asymmetric clusters in high-load scenarios
|Jun 27, 2005
|Nov 17, 2005
|Oracle International Corporation
|Runtime load balancing of work across a clustered computing system using current service performance levels
|Jun 16, 2004
|Dec 22, 2005
|Jarmo Parkkinen
|Arrangement and method for optimizing performance and data safety in a highly available database system
|Jul 8, 2005
|Jan 26, 2006
|Volker Sauermann
|Data processing system and method for assigning objects to processing units
|Jul 28, 2004
|Feb 2, 2006
|Oracle International Corporation, (A California Corporation)
|Methods and systems for validating a system environment
|Jul 28, 2004
|Feb 16, 2006
|Oracle International Corporation
|Methods and systems for modifying nodes in a cluster environment
|Dec 20, 2004
|Jun 22, 2006
|Enzo Cialini
|Apparatus, system, and method for database provisioning
|Dec 27, 2004
|Jun 29, 2006
|Chan Wilson W S
|Dynamic remastering for a subset of nodes in a cluster environment
|Dec 20, 2004
|Jul 6, 2006
|Oracle International Corporation
|Cursor pre-fetching
|Mar 1, 2006
|Jul 6, 2006
|Lik Wong
|Techniques for making a replica of a group of database objects
|Mar 1, 2006
|Jul 13, 2006
|Lik Wong
|Techniques for replicating groups of database objects
|Mar 29, 2005
|Sep 21, 2006
|Network Equipment Technologies, Inc.
|Replication of static and dynamic databases in network devices
|Sep 6, 2006
|Feb 1, 2007
|International Business Machines Corporation
|Method, system and program for forming a consistency group
|Apr 16, 2007
|Aug 9, 2007
|Cyberview Technology, Inc.
|Universal game server
|Aug 31, 2007
|Dec 20, 2007
|International Business Machines Corporation
|Fail over resource manager access in a content management system
|Apr 20, 2006
|Feb 26, 2009
|Holt John M
|Modified computer architecture for a computer to operate in a multiple computer system
|May 9, 2008
|Apr 23, 2009
|Frankie Wong
|Method and apparatus for sequencing transactions globally in a distributed database cluster
|Feb 17, 2011
|New Technology/Enterprise Limited
|Distributed transaction processing
|Jul 28, 2011
|Vmware, Inc.
|Data replication method
|Mar 18, 2011
|Sep 20, 2012
|Microsoft Corporation
|Seamless upgrades in a distributed database system
|Dec 21, 2012
|Jun 26, 2014
|International Business Machines Corporation
|Consistent replication of transactional updates
|Apr 22, 2005
|Nov 3, 2005
|William R Pape
|Method and system for private data networks for sharing food ingredient item attribute and event data across multiple enterprises and multiple stages of production transformation
|Oct 24, 2012
|May 23, 2013
|Sybase, Inc.
|Mutli-path replication in databases
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|May 28, 2002
Owner name: INCEPTO LTD., ISRAEL
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GORDON, RAZ;AHARON, EYAL;REEL/FRAME:012941/0704
Effective date: 20020528


text:
Or the Canadian version - BOK-EH? :DQuote:
Originally Posted by donbga
Printable View
Or the Canadian version - BOK-EH? :DQuote:
Originally Posted by donbga
"Bokeh" comes from the Greek word "boukali" that means "bottle" and, as elekm correctly put it, the effect that sharp images usually produce on film in the cameras that are held by drunken photographers. Or, the result on the film that someone obtains when he exchanges his/her Planar by a cheaper lens made out of a cut Bottle Bottom End (the cut BBE's are what has remained from the bottles used by Blues Guitar players for the "sliding guitar effect" (SGE) so proudly produced in the Southern Regions of the USA...)
Alright. Let me finish my drink, and I'll go creative on my way home with the empty bottle!Quote:
Originally Posted by George Papantoniou
I'm sure that an empty Sake bottle will help you get creative (at least for a few hours after consuming its content)...Quote:
Originally Posted by firecracker
So, with German lens you get beer bokeh, with Japanese lens you get sake bokeh.
Considering that Schneider makes their lenses in Bad Kreuznach, you could hope to get Trockenbeerenauslesebokeh. But I'm afraid Rodenstock is irredeemably beerish.Quote:
Originally Posted by butterflydream
How about Soju liquor? Does it make you creative?Quote:
Originally Posted by butterflydream
That liquor totally knocked me out in the restroom in a bar once and I couldn't make it home that night. I was pretty artistic with myself on the floor.
I think that I have an old bottle of Trockenbeerenauslese in my basement, Ole... I could invite anyone who can pronounce it for a party in my place to empty it, but I guess that it won't be very crowded...Quote:
Originally Posted by Ole
If you say when, I'll bring a coupla '78 J. J. Prum TBAs. Nectar!Quote:
Originally Posted by George Papantoniou
I'll be there! :pQuote:
Originally Posted by George Papantoniou

subset: commoncrawl


text:
, 2:19
First online:
Statins in the critically ill
- Isabelle De LoeckerAffiliated withDepartment of Intensive Care, Erasme University Hospital
- , Jean-Charles PreiserAffiliated withDepartment of Intensive Care, Erasme University Hospital Email author
The use or misuse of statins in critically ill patients recently attracted the attention of intensive care clinicians. Indeed, statins are probably the most common chronic treatment before critical illness and some recent experimental and clinical data demonstrated their beneficial effects during sepsis, acute lung injury (ALI)/acute respiratory distress syndrome (ARDS), or after aneurismal subarachnoidal hemorrhage (aSAH). Due to the heterogeneity of current studies and the lack of well-designed prospective studies, definitive conclusions for systematic and large-scale utilization in intensive care units cannot be drawn from the published evidence. Furthermore, the extent of statins side effects in critically ill patients is still unknown. For the intensive care clinician, it is a matter of individually identifying the patient who can benefit from this therapy according to the current literature. The purpose of this review is to describe the mechanisms of actions of statins and to synthesize the clinical data that underline the relevant effects of statins in the particular setting of critical care, in an attempt to guide the clinician through his daily practice.
KeywordsMevalonate HMG-CoA reductase Sepsis Acute lung injury Acute respiratory distress syndrome Subarachnoid hemorrhage
- Title
- Statins in the critically ill
- Open Access
- Available under Open Access This content is freely available online to anyone, anywhere at any time.
- Journal
Annals of Intensive Care
- Online Date
- June 2012
- 10.1186/2110-5820-2-19
- Online ISSN
- 2110-5820
- Publisher
- Springer-Verlag
- Additional Links
- Topics
- Keywords
- Mevalonate
- HMG-CoA reductase
- Sepsis
- Acute lung injury
- Acute respiratory distress syndrome
- Subarachnoid hemorrhage
- Authors
- Author Affiliations
- 1. Department of Intensive Care, Erasme University Hospital, Route de Lennik 808, B-1070, Brussels, Belgium


text:
Oy Vey! Something went wrong. We are very sorry, please try again later.
Sterling Silver Garlic Clove MiniatureProduct ID: CLF-CS-28217
Chat with a Judaica expert Click Here
People who bought this item also bought:
Sterling Silver Garlic Clove Miniature
Material Sterling silver 925
Dimensions 7.3x5cm
Estimated processing time: 4-8 Business Days.
Your order's processing time is the estimated number of days that it will take for your order to be prepared for shipment from our Israel-based fulfillment center.
Sterling Silver Garlic Clove Miniature
This sterling silver miniature features a small cluster of garlic cloves and has engraved lines that create the stem, bottom edge and individual cloves.
Sterling Silver Garlic Clove Miniature Customer Reviews
Average customer review 0 Customer Reviews


text:
Contractor Management
Focus on what you do best and let Highveld maximise your income. We will handle all your statutory compliance and structure your package optimally to ensure you take more home each month. Think of us as your back office that handles the administration related to your contract while also exposing you to top opportunities at our blue chip clients.
Vendor Access and Business Advisory
Looking to render your services as an SMME? Let us assist you with the business planning and setting up the correct infrastructure in place. We specialise in enabling contractors to succeed in their quest for growth. Use our vendor access service to invoice the contracting client directly for services rendered and enjoy peace of mind. We will manage the entire contract administration process, monthly invoicing for services rendered and processing of payments.
Sourcing Services
We are not a recruitment company, we are a company that understands the importance of exposing our contractors to quality opportunities. Whether you are looking for short or long term opportunities, Highveld has a rich database and established networks to secure these for you.
Professional Financial and Tax Services
Your financial well-being is just as important as your physical well-being. All of our contractors and consultants receive one–on-one financial planning from our in house financial planners. We view this as a critical ingredient in ensuring your long term success. Your financial affairs will be managed by professionals who understand the consulting world.


text:
How Mavis Gallant avoided her own death in Paris
Listening to Mavis Gallant recount how a year ago she was lying on the floor unconscious for three nights but miraculously survived, I felt myself being swept into a richly detailed Gallant short story, filled with brilliant observations and lively characters.
|Report an Error
Share via Email
But this was not one of the compact gems of fiction that earned her an international reputation as a literary genius as well as a following among readers of The New Yorker and countless prizes, including the Governor General's Award in the country from which she exiled herself six decades ago.
Nor was it an extract from her wonderful new collection, Going Ashore, which brings together between hard covers some of her most neglected stories, having fallen into limbo after appearing in magazines long ago.
Happily, the stories have now been born again and they wear remarkably well. I was especially taken with those from Gallant's first decade as a published fiction writer, the 1950s, when she roamed around postwar Europe discovering displaced characters in transit while trying to make sense of the trauma that had shaken the world.
Even more happily, these stories are not being published posthumously. Gallant is alive and well and living in Paris, in the same tiny apartment she has called home since 1960. And at 86, despite some physical frailty, her mind is as inimitably sharp as ever, her face still beautiful and her talent for spinning a yarn undiminished.
Now she was applying her gifts not to a written piece of fiction but to an oral account of the literal truth concerning her near-death ordeal: cold facts with nothing invented, yet sparkling with so many fragments of insight, dialogue, irony and interpretation that the episode seemed already shaped into an oral masterpiece.
"I call it my accident because that's the term the hospital used," she explains. "The concierge in my building, a lovely Portuguese woman, was worried that I hadn't been picking up my mail, and on the fourth day I was found after she decided to send for a locksmith."
The concierge found the revered author crumpled on the floor like a rag doll.
"I felt someone with tears against my cheek," Gallant recalls. "She thought I was dead, but then I opened my eyes. Another few hours and my brain would have been mashed potatoes."
In the ambulance on the way to the hospital, for reasons she still does not understand, she had the delusion that she was in China, involuntarily detained.
After two months of institutional care, she returned home and picked up the threads of the Paris life she chose long ago, living alone and focusing on her dream of being a writer dependent on no one.
When we met for a long lunch a few months ago at one of her favourite Paris restaurants, Le Dôme in Montparnasse, I was apprehensive about how damaged she might be – but relieved to find her zest for life as invigorating and engaging as ever.
"The episode left no trace on the brain," she explained yesterday in a phone interview. "It wasn't a stroke. I woke up talking." Gradually teaching herself to walk, she made a dramatic recovery.
"What I had was a strong will to live," she notes. "I wanted to leave the geriatric hospital because it was full of old people and the only old person I like to have around is me."
I'd say what keeps Gallant charging ahead are the same drive and curiosity that prompted her in 1950, after The New Yorker accepted an early story called "Madeline's Birthday," to quit a perfectly good job as a leading Montreal journalist and move to Paris to pursue her dream of writing fiction full-time.
"I was young and idealistic, and when I first got to Europe I felt freed. I could go where I wanted. There were things I wanted to find out for myself. One was what happened in Germany. How was it that these people with such high culture did not stand up and say no to the most barbaric acts in history? So I travelled around, filling my notebooks."
That hunger for knowledge pays off in the rewarding detail of tales about displaced characters in such places as Salzburg, Austria; Tangiers, Morocco; and Menton, on the French Riviera.
A few years ago, Gallant told her long-time Canadian editor, Douglas Gibson, that she wished her lost stories could be revived in a book before she died. "I was joking, but he took me seriously," she says.
Now those lost stories have been found and her wish has come true.
The true beneficiaries are her devoted readers, who will find in these pages a deeply satisfying glimpse of just what Mavis Gallant was looking for when she left Canada 59 years ago.
Top News
- Josh Donaldson out for redemption, revenge in return to playoffs
- Toronto vs. Dallas: Bring it on
- Video Toronto funeral mass celebrates life of Michael Burgess
- Pacific Rim trade deal reignites economy as election issue
- Rocky road to justice for Kunduz hospital airstrike victims
- 'Long pathway' ahead at inquest into deaths of aboriginal students
- The surprise GTA region where house prices are up 14%
- Brampton council gives itself a hefty pay hike
Editorial Board
commercial promo
Most Popular
Blue Jays' Josh Donaldson, Cap'n Clutch, in search of a better end
The surprise GTA region where house prices are up almost 14 per cent
University of Toronto alters bathroom policy after two reports of voyeurism
Video Why the Blue Jays should beat the Texas Rangers and how they might still lose
Rogers, Bell and Telus hike Internet speeds, prices with 'gigabit' service
Crowd at Yonge-Dundas hurls bottles, obscenities at police during Nuit Blanche
Maple Leafs president Brendan Shanahan goes on ice to hand out pointers


text: Ke$ha Ad Campaign by Hilton Hater at August 20, 2010 11:16 am. Comments We're behind the scenes with Ke$ha in this video. The singer speaks on her affiliation with watch brand Baby-G and shows off some ads for it. Share Tweet Email Edit Delete Follow Kesha? Facebook Disqus Star: Kesha Related Videos: Kesha Videos Related Post: Ke$ha Poses for Baby-G Ad Campaign Uploaded by: Hilton Hater Uploaded: August 20, 2010


text:
Writing Center
Welcome back, students!
Saving the World, One Thesis at a Time
Welcome back, students!
Who We Are
Students can get help at various stages of writing, from brainstorming ideas to the finishing touches on the conclusion.
Click below to find out more about our team!
What We Do
Purpose of Tutoring Sessions
The focus of tutoring sessions is to help writers gain one or two skills that they can apply to future writing assignments, thereby permanently improving their writing. Simply helping writers to edit their work does not result in long-term learning.
Therefore, tutoring sessions are not intended to:
- take the place of in-class writing instruction or discussion of writing assignments
- correct, edit, or make papers error-free
- guarantee results or grades; writers are always responsible for their own work.
|Regular Semester Hours
|9am - 6pm
|Tu, Th
|9am - 7pm
|9am - 3pm
Contact Writing Center
Theresa FitzPatrick, Director
Local: (651) 603-6233
E-mail: email@example.com
Mailing Address
1282 Concordia Avenue
St. Paul, MN 55104-5494
Campus: 651-641-8230


text:
Aveda Control Paste 1.7 oz.
We know you want the goods as soon as possible, which is why orders received by 3pm ET leave our warehouse the very same day. We'll send you an email that day to confirm shipment and the email will include your tracking information.
Our warehouse is closed Saturday & Sunday, so orders received after 3pm ET on Fridays will not ship out until Monday.
Loose and piece-y, or stand-up and messy-new Aveda Control Paste gives hair a high-textured, low-sheen look that's smooth, not sticky
- Dry hair styling
- Pliable hold
- All hair types
Emulsify in your hand and work through dry hair with fingertips. Apply more product as desired.
Folica stands behind the authenticity of everything we sell. Since 1998, Folica has made it our mission to provide you with an outstanding selection of hair and beauty products at highly competitive prices.


text:
$33.81Go to Amazon.com M...
Ingles Movil/ Portable English
Who says a great gift has to cost a lot? Take care of everyone on your "nice list" from the kids in your life to the stylish hostess for under $20 each with ... Read More
Forget stocking stuffers. Andrew Jackson might be your only friend when it comes time for that big holiday buy. Here's our guide to finding cool holiday gift... Read More
Fredflare.comFor a Mom With a Black Thumb… This cheerful flower kit is the ultimate low-effort garden starter: Open the can, pour in water, and flowers wil... Read More
Amazon.com Market...
Unknown Tax
Shipping N/A
|New Item
Find, Compare, Read Reviews & Buy the Ingles Movil/ Portable English Online @ Yahoo Shopping Want to see your products in Yahoo Shopping? Advertise with us. Sitemap All Brands
Terms | Privacy | About Our Ads | Help


text:
Your blog site is excellant. When my spirits are low I just go through couple of stories and it peps me up. I will narrate a story and I will tell you later how I am connected to it. 472 more words
Malayalam Kambi kathakal Kochupusthakam
Malayalam kambi kathakal kochupusthakam, malayalam sex stories, Download all hot stories, the stories, Here you can download malayalam kambikathakal, Mallu Aunty Kambi kathakal, … 53 more words


text:
Netwerk profielen
Facebook: Fheolina Louis Ever | Facebook
Fheolina Louis Ever is on Facebook. Join Facebook to connect with Fheolina Louis Ever and others you may know. Facebook gives people the power to share and makes the ...
Buy Before Versailles: A Novel of Louis XIV on | WOW HD Nederland
Get the best price on
Publicaties algemeen
Deals Louis Vuitton Pochette Accessories NM Epi Leather Citron ...
sailor it wasn't louis ever since soviet. Are magnificent theater tablet can, bags ...
nu.nl: Lifestyle: Sienna Miller verkoopt tweedehands kleding voor goed doel
2013-08-19 18:56 [nu.nl] - Op de veilingsite HardlyEverWornIt.com zijn merkgoederen te koop voor een goedkopere prijs. M...
Stirring funeral for icon Musial - TTP Sports Center - Test The Planet
Stirring funeral for icon Musial - posted in TTP Sports Center: ST. LOUIS - A stranger approached Stan Musial's grandson Andrew Edmonds during the Hall of...
Artikelen & Opinie
(1 - 4 van 9
Twitter: swagger! (ClarenPascua1)
20.07.2012 hahaah,, niall and louis !!.. #ever http://t.co/xDfyoNH9
ccBoard Forum::NL in beeld::trainer Alan Sherman says C
staff from year-to-year to like St. Louis ever-so-slightly better.
pinterest.com: THE BEST PICTURE OF LOUIS EVER - Louis Tomlinson | Pinterest
Deze pin is ontdekt door Daniela Galo. Ontdek (en bewaar!) je eigen pins op Pinterest. - Meer over new haircuts, hair en shirts.
answers.com: Has Louis ever won the x factor
Did Louis Walsh ever won the x factor? Yes, he won the second series with Shayne Ward. Has a girl ever won the x factor? Leona was the first female winner in 2006 and ...
(1 - 19 van 21
BEST SONG EVER - Quizlet.nl
Zayn ever. Best Niall ever. Best Louis ever.
Echo, a x-overs fanfic | FanFiction
raising his hopes up, far too high for Louis ever to meet.
The Joe Louis Story - Online Video Streaming
round; that was the first time Joe Louis ever lost a professional boxing match.
• View topic - C1609 Hollister Clothing UK ON2D2 B9Z4O38L Hollist ...
Christian Louboutin Schweiz, and even unclear vistas Louis ever in your life said.
Gallery For > One Direction Niall And Louis Fight - imgarcade.com
Direction Niall And Louis Fight Seconds louis – ever the. Seconds louis .
Can Harvey and Louis Ever Be Friends?: Dissecting USA's ...
USA's newest legal drama "Suits" will return for its second season later this year, and we're eager to see how the relationship dynamics between all the characters ...
Did Louisville or St. Louis ever have a practice to work on...
twitter answers for Did Louisville or St. Louis ever have a practice to work on fundamentals and footwork? - qaster.com
Chapter 77 - Quizlet.nl
Chapter 77
Checker Records - www.706unionavenue.nl
Checker Records - www.706unionavenue.nl
The Lincoln Lawyer. Connelly Michael. Читать. Страница 71
Читать книгу The Lincoln Lawyer. Автор:Connelly Michael. Автор: Connelly Michael Жанр: Юмористическая фантастика Количество страниц: 88 Просмотров за сегодня:...
guestbook from louisstewart
A full discography would be much appreciated e.g. I'd love to know if Louis ever recorded with Tubby Hayes. Keep up the good work, Mark Corcoran
1directionbang: One Direction Big Bang - Story 1 - When The Best Part...
Hello ladies and the elusive gentlemen! After much struggle, here are the long-awaited big bangs! We hope you enjoy the stories and arts that our wonderful...
O16 - Quizlet.nl
My Story - Magical Kiss
She's makin' it harder, harder to breathe I'm gettin' weaker, so pullin' the strings The lights are all lost, there's no one around We've both lost our minds,...
don't even care about the table breaking - #8 - :)
1 | 2 | 3 | 4 Don't post page breaking images and don't spam images excessively. Rules - Page-A-Mod - Flat - Tinychat - Delicious
lnr_fics: Fic: From Euphoria
Title: From Euphoria Author: Lucy Rating: PG. Pairing: OT5 Genre: fluff Warnings: Nope! Disclaimer: I don't own One Direction and make no aspersions toward...
max_speaks: 10-8-05 Cadillac, Michigan
Louis ever comes to visit me... it seems like he would because he was ...
retorico: be still and know i am.
be still and know i am One Direction gen about Liam and Louis' relationship, with a bit of Harry/Louis. He could probably convince all of them to jump off a...
upagainstspace: fic; see you when i fall asleep (nick/harry)
Louis ever found out) but it's nice and Nick's wonderful so what does it even matter?
Zoekopdrachten gerelateerd aan Louis Ever
Alle personen
Voornaam "Louis" (4396)
Naam "Ever" (48)
gesorteerd op relevantie / datum


text:
Result in
Sony VAIO Laptops & Computers Discontinued | Sony UK
After decades in personal computing, Sony exits the PC market. Owners of VAIO products will continue to enjoy full warranty, support and customer care.
Result in
Support for VGN-CR29XN | Sony
Support - Notebook Support for VGN-CR29XN. <div class="infobox warning" />: Windows 10 information - August 19 Update. ...
Support for VAIO | Sony
Close Sony Sites. ...
Windows 10 information - August 19 Update
Use NFC to connect your BRAVIA TV to your mobile device
Result in
VGN-CR29XN: Motion Eye Unknown Device
Hi all!I have a notebook VGN-CR29XN and had a harddisc crash, when I have installed Windows Vista then my webcam device dont work and ar listed under ...
battery alarm for vista sony vaio vgn-cr29xn please
can anyone tell me how to get software for a battery alarm for a laptop windows vista vgn -cr29xnlaptop keeps shutting down without enough ...
How to disassemble the keyboard of VGN-CR29XN
Hi,Does anybody know how to remove the keyboard of the Vaio VGN-CR19XN? I need to do some cleaning to the laptop, but I just can't figure out how to ...
For ProfessionalsCareersContact UsCompany Info


text:
Williamstown Magic is a junior basketball club based in Williamstown, drawing players from Williamstown and surrounding suburbs as far as Altona, Footscray and Newport. We have teams in both the Altona Bay Basketball Association, with games played at the Altona Sports Centre and the Westgate Basketball Association with games played at Whitten Oval.
The club was founded in late 2005, entering five teams in the Summer 2005/2006 season of the Altona Bay Basketball Association. Recognising the need for another basketball club in the Williamstown area, the Burgess, Jones and Knight families had decided to form the club, and since then the club has grown steadily.
An important milestone in the growth of the club was the decision to formalise the structure through incorporation, which was finalised on 10 September 2008. Since then the club has continued to grow in the number of teams participating and in 2013 we entered teams in the Westgate Basketball Association.
UniformsIf you require a new uniform, please contact Sharon, on firstname.lastname@example.com.
Summer 2015/16 Registration
Registrations for the Summer 2015/16 season will be open shortly for both the Altona Bay Basketball Association and the Westgate Basketball Association.
Coaches - Players intentions for Summer 2015/16 Season & Coaches Meeetings
Coaches, please gather intentions for the next season from all your current players, please use the intent form below.
Intentions needs to be completed by the 7th of September & send them to the appropriate registrar, either email@example.com or firstname.lastname@example.com.
This intent form gives us sufficent information to enter the appropriate teams into the associations for next season.
We will hold coaches meetings to organise teams on the week of the 14th of September. We will be in touch with these details.


text:
Ericsson said Thursday it has agreed to license its third-generation phone platform to NEC.
The company said NEC will be using its U250 platform for WCDMA networks in Europe. For its part, NEC agreed to provide 3G mobile terminals to Ericsson to strengthen further its capabilities in third-generation phone networks.
Financial details of the agreement between the Swedish group and the Japanese electronics giant were not disclosed.
Copyright 2005 by United Press International
Explore further: Cryptographic algorithm can prevent unwanted sharing of personal data, including credit card numbers


text:
Ljiljanna Ravlich as Education Minister
Broadcast: 04/03/2005
Reporter: Rebecca Carmody
REBECCA CARMODY: When the Premier won Saturday's election, he said the centrepiece of his second term agenda would be education and training. This afternoon, the weight of responsibility fell on a relative newcomer to Cabinet. In the post-election carve-up, Ljiljanna Ravlich has been given the prized education and training portfolio. She's one of Labor's rising stars, having won a spot in Cabinet only six months ago. She joined me earlier.
Ljiljanna Ravlich, thanks for joining me. This is a massive promotion for you today. Are you feeling at all daunted by the task ahead?
LJILJANNA RAVLICH (Minister for Education and Training): I'm feeling very pleased, and I'm very grateful to the Premier for the opportunity. It's a challenge, but it's a challenge that I relish and I do it with honour.
REBECCA CARMODY: Six months ago you were not even in the Cabinet. Has this been an ambition for you?
LJILJANNA RAVLICH: It certainly has been an ambition. I have had a long history of involvement in education and training, having been a classroom teacher, a deputy principal, a principal education officer, an adviser to a training minister, and, therefore, looking after the portfolio of training to the Hon Gavin Troy.
REBECCA CARMODY: I'm getting a picture here that you are well qualified.
LJILJANNA RAVLICH: Well, I come with a long list of experiences in relation to this portfolio.
REBECCA CARMODY: What will be your priority areas then?
LJILJANNA RAVLICH: We will be looking to build 37 new schools - a $300 million injection into capital works. Obviously, the area of skills shortages is a very important area in the training area.
REBECCA CARMODY: Your predecessor had a terrible relationship with the teachers union. How much bridge mending have you got to do there?
LJILJANNA RAVLICH: I'm not aware that he did have a terrible relationship -
REBECCA CARMODY: That's how they describe the relationship.
LJILJANNA RAVLICH: - with the union. It's my intent to work with all the stakeholders in both education and training, and I will be meeting with them as soon as the opportunity avails itself.
REBECCA CARMODY: Teachers have said that they felt belittled by Alan Carpenter; that he focused on trivial things like dress codes for teachers and that primary school teachers wanted to work for only four days a week. What will you do to win their confidence?
LJILJANNA RAVLICH: If there are issues in respect of matters such as entitlements, they are issues that will obviously need to be discussed between myself and the State School Teachers Union.
REBECCA CARMODY: I understand that negotiations for a new pay deal for teachers will start up in August. That's going to be a big challenge for you. The union told me today that they are looking for substantial pay increases. I know it is early days, but how do you feel about that?
LJILJANNA RAVLICH: It is very early days. Obviously, we will go through the negotiation process and see where it will take us. At this point, I will not be pre-empting the outcome.
REBECCA CARMODY: A number of your colleagues have got their noses out of joint over the cabinet reshuffle, particularly the fact that no new women were included in the Cabinet. Some of your colleagues told me it was pathetic and extremely disappointing. When your colleagues talk about the Labor Party as being a boys' club, is that right or wrong?
LJILJANNA RAVLICH: I think it's harder for women in every occupation. Politics is no different from other occupations in that regard. The simple fact is that we have not lost any women. In fact, in my own case, I have become the Deputy Leader of the Legislative Council -
REBECCA CARMODY: Should the party be doing better? We have got five out of 17, which is not even 30 per cent. Is that acceptable?
LJILJANNA RAVLICH: We could do better in respect of women across all industry sectors.
REBECCA CARMODY: Life is really going to change for you. You're taking on a very high-profile position. When things go wrong, you will be fodder for the cartoonists and be the subject of talkback radio. Are you prepared for this sort of life?
LJILJANNA RAVLICH: It's part of the territory. You know that when you get into politics. When you take on these positions, basically, it's a part of the patch.
REBECCA CARMODY: Have you got thick skin?
LJILJANNA RAVLICH: I've got very thick skin and I think women in politics need to have thick skin. I don't think that will be a problem at all.
REBECCA CARMODY: Thanks for joining me.
LJILJANNA RAVLICH: Thank you.


text:
Playing With: Does Not Like Men
Basic Trope: A (usually female) character has a negative attitude about the male gender.
Back to Does Not Like Men
- Straight: Alice has a tough time befriending men and letting them get close to her. She may also view them as The Unfair Sex to some extent.
- Exaggerated:
- Alice outright hates men, and believes the world would be better off without them. She may even move into (or start) a Lady Land with like-minded women to facilitate this, or conspire into an outright Gendercide.
- Alice freaks out and shoots Bob when all he said to her is, "Hi."
- Downplayed:
- Alice avoids interacting with men, but she doesn't actively hate them either.
- Alice thinks men are okay, but inferior towards women.
- Justified:
- Alice was raped or abused (maybe by a stranger, maybe by a relative, maybe by a boyfriend), and this is her way of preventing that from happening again.
- Alice is a Straw Feminist.
- Alice comes from a No Woman's Land where men have comitted terrible deeds against their female peers.
- Inverted:
- Gender-Inverted: Bob is a He-Man Woman Hater.
- Subverted:
- We hear Alice hates men, but that was just slander...
- Or, we hear she hates men, but she's shown to be just as bitter to her fellow women. She's actually just an all-round Jerkass...
- Double Subverted:
- Which turns out to be true...
- But then she comes out with the fact that she hates men especially...
- Parodied: Alice hates men with a burning passion... The problem is that "she" is a man himself! (Not that you'd inmediately know it, mind you)
- Zig Zagged:
- Alice's attitude towards men varies between hating them, a mild dislike, and really liking them.
- Alice dislikes some men, but not others.
- Averted: Alice gets along alright with the male characters.
- Enforced:
- Lampshaded: "Why did you trip Bob this morning?" "Because he's a man."
- Invoked: Bob does things (deliberately or unintentionally) to offend or upset or annoy Alice.
- Exploited: ???
- Defied: "Yes, I know that bashing men for being men makes a woman look cool, strong and independent but that's not the kind of "coolness" or "strength" or "independence" I'm looking for, thank you."
- Discussed: "It's not that I hate men. It's just that I haven't met any decent one yet."
- Conversed: ???
- Deconstructed: After rejecting each and every man who had an interest in her and carefully avoiding to interact with peope born with a Y-chromosome, Alice ends up an old spinster, surrounded by cats and unable to have a normal interaction with anyone.
- Reconstructed: Alice learns that not all men suck, and gets to know at least one that she can have a positive relationship with.
- Played For Laughs:
- Alice is a Hysterical Woman in a piece of Satire
- Slap-Slap-Kiss
Back to Does Not Like Men


text:
Linda Polin, firstname.lastname@example.com
Gary Stager, email@example.com
Survey results from a variety of polling agencies:
Public Agenda, Phi Delta Kappan/Gallup, The Business Roundtable, American Association of School Administrators, Harris Interactive
Legal Cases on High Stakes Testing
Shelley Mack, UC Berkeley, Boalt Hall School of Law, Spring 2000
NEA http://www.nea.org/issues/high-stakes/
FairTest http://www.fairtest.org
Rethinking Schools www.rethinkingschools.org
Mathematically Sane http://www.mathematicallysane.com/analysis/highstakes.htm
NCTE http://www.ncte.org/resolutions/highstakes1999.html
Alfie Kohn http://www.alfiekohn.org/standards/standards.htm
EdSource http://www.edsource.org/
Rouge Forum http://www.pipeline.com/~rgibson/rouge_forum/
CalCare http://www.calcare.org/
Canadian Teachers Org. http://www.ctf-fce.ca/e/what/other/assessment/high-stakes.htm
Signatures for Students http://www.xsnrg.com/sfs/
Florida Coalition for Assessment Reform. http://www.angelfire.com/fl4/fcar
AZ Standards (Arizona) http://www.azstandards.org/
North Carolina Citizens for Democratic Schools http://www.geocities.com/nccds/
TASI (Illinois) http://www.district87.org/staff/goerlitzd/tasisat/about.htm
Student Coalition for Alternatives to the MCAS http://www.scam-mcas.org/
MassParents Page http://www.massparents.org/
Parents Against TAAS Testing http://www.TaasBlues.com/
Exam Anxiety (a terrific commentary challenging the Bush testing scheme)
Teacher Magazine, August, 2001.
News Interview: Lorrie Shepard. How to Fight a "Death Star"
NEA Today Online, January, 2001.
What Can Student Drawings Tell Us About High-Stakes Testing in Massachusetts?
Anne Wheelock, Damian Bebell, and Walt Haney
How Wisconsin Parents Worked to Roll Back High Stakes Testing
FairTest Examiner, Summer 1999, pp. 10-11
The Harmful Impact of the TAAS System of Testing in Texas: Beneath the Accountability Rhetoric.
Linda McNeil & Angela Valenzuela
"High Stakes Tests: A Harsh Agenda for America's Children"
Remarks Prepared for U.S. Senator Paul D. Wellstone
Teachers College, Columbia University, March 31, 2000
The Scarsdale, NY Revolt
The Marin, CA Revolt
Greely, Colorado teacher refuses to administer standardized tests
High-Stakes Testing: Is it fair to students?
Ted Villaire, staff writer
Our Children, The National PTA Magazine
Rethinking Schools, Failing Our Kids: Why the Testing Craze Won't Fix Our Schools. Rethinking Schools: Milwaukee, WI, 2000. ISBN 0-942961-26-9
W. James Popham, Testing! Testing! What Every Parent Should Know About School Tests. Allyn & Bacon: Boston, 2000. ISBN 0-205-30595-4
National Research Council, High Stakes: Testing for Tracking, Promotion, and Graduation. National Academy Press: Washington DC, 1999. ISBN 0-309-06280-2
Deborah Meier (editor), Will Standards Save Public Education? Beacon Press: Boston, 2000.ISBN 0-8070-0441-3
Alfie Kohn, The Case Against Standardized Testing: Raising the Scores, Ruining the Schools. Heinemann: Portsmouth. 2000. ISBN: 0325003254
Linda McNeil, Contradictions of School Reform : Educational Costs of Standardized Testing (Critical Social Thought). Routledge, 2000. ISBN: 0415920744
Susan Ohanian, One Size Fits Few : The Folly of Educational Standards.Portsmouth: Heinemann: Portsmouth, 1999. ISBN: 0325001588
How Standardized Testing Damages Education
The Side Effects of Standardized Testing
What Should Parents Know About Standardized Testing in Schools?
Testing, Testing, Testing... From the Merrow Report on PBS
Roger Schank's Provocative Educational Outrage Columns
More to come... Check back often!
|© 2000 PencilsDown.org


text:
Town Square
UNITS donation to Shepherds Gate Shelter helps in more ways than one
Original post made by Member, Livermore, on Nov 27, 2009
November, 2009-East Bay, CaFor the past 25 years, the Shepherd's Gate Shelter has been providing aid and protection to homeless and battered women and children. Completely funded by donations and run through the help of volunteers, the shelter is an amazing example of the kind hearts that live in the East Bay area. However, with somewhat limited resources, the shelter needs even more support as the holiday season rolls around. Donna Topp, owner of the East Bay UNITS Mobile Storage, helped to make a huge difference by offering to provide assistance crucial to maintaining the safe haven these women and children need.
Knowing that the shelter would need a place to store clothes and toys for the Christmas season before distributing them, Donna planned to donate a UNIT for the month of December. Just recently, Keelie Chamberland from the shelter called and asked to use the UNIT a month and a half earlier to store supplies used to rebuild the fence around the property. Of course, Topp agreed.
"Keelie told me that the shelter had finally gotten the supplies and manpower to rebuild the dilapidated fence, but they didn't have a place to store everything," says Topp. "Without the UNIT, the supplies would have been covered with a tarp without any security. After all that they do for these families, the least I could do was ensure that the wood for the project wouldn't get stolen or damaged."
A storage unit that is easily moved, packed, and relocated is just what the shelter needed. The fencing project will begin the first week of December and new/unused gifts can be donated between 9:30 and 4:30 from December 1st -22nd at 1660 Portola Avenue in Livermore. For more information call the Shepherd's Gate Shelter at (925) 423-4283.
Topp explains, "After all that Shepherd's Gate does for these families, the least we could do was make the volunteers' lives a little easier. So many people come together to make sure that the Shelter succeeds: companies, families, Boy Scout troops and more. We're just glad to be a part of it."
We'll set up an interview for you to talk with a UNITS representative and a Shepherd's Gate volunteer about the shelter's fantastic work, and the rewards of community participation and charity during the holiday season.
About UNITS Mobile Storage
Founded in 2003 by Michael McAlhany, UNITS Mobile Storage, a technology-leading, affordable and convenient mobile-storage company, provides a hassle-free solution to the moving process by offering door-to-door mobile storage - saving customers both time and money. UNITS has raised the bar in mobile storage quality, customer care and innovation while offering specifically designed containers that are water, mold and UV resistant. The company continues to grow aggressively and now has more than 25 locations operating throughout the nation. For more information, please visit www.UnitsEastBay.com.
Don't miss out on the discussion!
Sign up to be notified of new comments on this topic.
The Cleric and the clerk*
By Tom Cushing | 19 comments | 711 views
The Arts and Critical Thinking
By Roz Rogoff | 7 comments | 512 views
Prosperity problems in the Bay Area
By Tim Hunt | 7 comments | 494 views


text:
From the Gilead official site:
Note that you still have to properly initialize PersistentBeanManager with associated PersistenceUtil, proxy store and possibly class mapper. This must be done before any remote call, in Remote Service constructor or in inherited "init" method (do not forget to call super.init() !):
public UserRemoteImpl()
HibernateUtil hibernateUtil = new HibernateUtil(MyApplicationHibernateUtil.getSessionFactory());
PersistentBeanManager persistentBeanManager = GwtConfigurationHelper.initGwtStatelessBeanManaer(hibernateUtil);
I Use JPA, do i have to do something different?