read-only this thisdocument编译错误 is locked for editing by another user怎么解决

Disable Protected View In Office 2010
By default Office 2010 will open documents in protected mode that fail validation, have been downloaded from the internet, are located in potentially unsafe location and include attachments. Protected view opens the document in read-only mode thus minimizing the exposure to some potential security threat.If you are an experienced user who is annoyed by the protected view, you can always disable it even though it is not recommended by Microsoft.Open MS Word 2010, go to File Menu(Office Backstage) and select Options. Select Trust Center from the left sidebar and then click Trust Center Settings button in the main window. Now in Trust Center dialog window, select Protected View from the left sidebar and disable protected view for any desired option.You can disable Protected View for files that failed validation, that have been downloaded from the internet, are located in unsafe locations, and/or contain attachments.
RECOMMENDED FOR YOU
When done, hit OK. The above example is that of Word 2010, you will have to manually uncheck the options from Excel 2010, PowerPoint 2010, Outlook 2010, etc.
Leave a comment
Related ReadingFrom Wikipedia, the free encyclopedia
In , , and , the two-phase commit protocol (2PC) is a type of
(ACP). It is a
that coordinates all the processes that participate in a
on whether to
or abort (roll back) the transaction (it is a specialized type of
protocol). The protocol achieves its goal even in many cases of temporary system failure (involving either process, network node, communication, etc. failures), and is thus widely used. However, it is not resilient to all possible failure configurations, and in rare cases, user (e.g., a system's administrator) intervention is needed to remedy an outcome. To accommodate recovery from failure (automatic in most cases) the protocol's participants use
of the protocol's states. Log records, which are typically slow to generate but survive failures, are used by the protocol's . Many protocol variants exist that primarily differ in logging strategies and recovery mechanisms. Though usually intended to be used infrequently, recovery procedures compose a substantial portion of the protocol, due to many possible failure scenarios to be considered and supported by the protocol.
In a "normal execution" of any single
( i.e., when no failure occurs, which is typically the most frequent situation), the protocol consists of two phases:
The commit-request phase (or voting phase), in which a coordinator process attempts to prepare all the transaction's participating processes (named participants, cohorts, or workers) to take the necessary steps for either committing or aborting the transaction and to vote, either "Yes": commit (if the transaction participant's local portion execution has ended properly), or "No": abort (if a problem has been detected with the local portion), and
The commit phase, in which, based on voting of the cohorts, the coordinator decides whether to commit (only if all have voted "Yes") or abort the transaction (otherwise), and notifies the result to all the cohorts. The cohorts then follow with the needed actions (commit or abort) with their local transactional resources (also called recoverable resources; e.g., database data) and their respective portions in the transaction's other output (if applicable).
Note that the two-phase commit (2PC) protocol should not be confused with the
(2PL) protocol, a
The protocol works in the following manner: one node is a designated coordinator, which is the master site, and the rest of the nodes in the network are designated the cohorts. The protocol assumes that there is
at each node with a , that no node crashes forever, that the data in the write-ahead log is never lost or corrupted in a crash, and that any two nodes can communicate with each other. The last assumption is not too restrictive, as network communication can typically be rerouted. The first two assumptio if a node is totally destroyed then data can be lost.
The protocol is initiated by the coordinator after the last step of the transaction has been reached. The cohorts then respond with an agreement message or an abort message depending on whether the transaction has been processed successfully at the cohort.
or voting phase
The coordinator sends a query to commit message to all cohorts and waits until it has received a reply from all cohorts.
The cohorts execute the transaction up to the point where they will be asked to commit. They each write an entry to their undo log and an entry to their .
Each cohort replies with an agreement message (cohort votes Yes to commit), if the cohort's actions succeeded, or an abort message (cohort votes No, not to commit), if the cohort experiences a failure that will make it impossible to commit.
or Completion phase
If the coordinator received an agreement message from all cohorts during the commit-request phase:
The coordinator sends a commit message to all the cohorts.
Each cohort completes the operation, and releases all the locks and resources held during the transaction.
Each cohort sends an acknowledgment to the coordinator.
The coordinator completes the transaction when all acknowledgments have been received.
If any cohort votes No during the commit-request phase (or the coordinator's timeout expires):
The coordinator sends a rollback message to all the cohorts.
Each cohort undoes the transaction using the undo log, and releases the resources and locks held during the transaction.
Each cohort sends an acknowledgement to the coordinator.
The coordinator undoes the transaction when all acknowledgements have been received.
Coordinator
QUERY TO COMMIT
--------------------------------&
VOTE YES/NO
prepare*/abort*
&-------------------------------
commit*/abort*
COMMIT/ROLLBACK
--------------------------------&
ACKNOWLEDGMENT
commit*/abort*
&--------------------------------
An * next to the record type means that the record is forced to stable storage.
The greatest disadvantage of the two-phase commit protocol is that it is a blocking protocol. If the coordinator fails permanently, some cohorts will never resolve their transactions: After a cohort has sent an agreement message to the coordinator, it will block until a commit or rollback is received.
In many cases the 2PC protocol is distributed in a computer network. It is easily distributed by implementing multiple dedicated 2PC components similar to each other, typically named
(TMs; also referred to as 2PC agents or Transaction Processing Monitors), that carry out the protocol's execution for each transaction (e.g., 's ). The databases involved with a distributed transaction, the participants, both the coordinator and cohorts, register to close TMs (typically residing on respective same network nodes as the participants) for terminating that transaction using 2PC. Each distributed transaction has an ad hoc set of TMs, the TMs to which the transaction participants register. A leader, the coordinator TM, exists for each transaction to coordinate 2PC for it, typically the TM of the coordinator database. However, the coordinator role can be transferred to another TM for performance or reliability reasons. Rather than exchanging 2PC messages among themselves, the participants exchange the messages with their respective TMs. The relevant TMs communicate among themselves to execute the 2PC protocol schema above, "representing" the respective participants, for terminating that transaction. With this architecture the protocol is fully distributed (does not need any central processing component or data structure), and scales up with number of network nodes (network size) effectively.
This common architecture is also effective for the distribution of other
besides 2PC, since all such protocols use the same voting mechanism and outcome propagation to protocol participants.
research has been done on ways to get most of the benefits of the two-phase commit protocol while reducing costs by protocol optimizations and protocol operations saving under certain system's behavior assumptions.
Presumed abort or Presumed commit are common such optimizations. An assumption about the outcome of transactions, either commit, or abort, can save both messages and logging operations by the participants during the 2PC protocol's execution. For example, when presumed abort, if during system recovery from failure no logged evidence for commit of some transaction is found by the recovery procedure, then it assumes that the transaction has been aborted, and acts accordingly. This means that it does not matter if aborts are logged at all, and such logging can be saved under this assumption. Typically a penalty of additional operations is paid during recovery from failure, depending on optimization type. Thus the best variant of optimization, if any, is chosen according to failure and transaction outcome statistics.
2PC protocol (also called Nested 2PC, or Recursive 2PC) is a common variant of 2PC in a , which better utilizes the underlying communication infrastructure. The participants in a distributed transaction are typically invoked in an order which defines a tree structure, the invocation tree, where the participants are the nodes and the edges are the invocations (communication links). The same tree is commonly utilized to complete the transaction by a 2PC protocol, but also another communication tree can be utilized for this, in principle. In a tree 2PC the coordinator is considered the root ("top") of a communication tree (inverted tree), while the cohorts are the other nodes. The coordinator can be the node that originated the transaction (invoked recursively (transitively) the other participants), but also another node in the same tree can take the coordinator role instead. 2PC messages from the coordinator are propagated "down" the tree, while messages to the coordinator are "collected" by a cohort from all the cohorts below it, before it sends the appropriate message "up" the tree (except an abort message, which is propagated "up" immediately upon receiving it or if the current cohort initiates the abort).
The Dynamic two-phase commit (Dynamic two-phase commitment, D2PC) protocol is a variant of Tree 2PC with no predetermined coordinator. It subsumes several optimizations that have been proposed earlier. Agreement messages (Yes votes) start to propagate from all the leaves, each leaf when completing its tasks on behalf of the transaction (becoming ready). An intermediate (non leaf) node sends when ready an agreement message to the last (single) neighboring node from which agreement message has not yet been received. The coordinator is determined dynamically by racing agreement messages over the transaction tree, at the place where they collide. They collide either at a transaction tree node, to be the coordinator, or on a tree edge. In the latter case one of the two edge's nodes is elected as a coordinator (any node). D2PC is time optimal (among all the instances of a specific transaction tree, and any specific Tree 2PC pro all instance each instance has a different node as coordinator): By choosing an optimal coordinator D2PC commits both the coordinator and each cohort in minimum possible time, allowing the earliest possible release of locked resources in each transaction participant (tree node).
, Vassos Hadzilacos, Nathan Goodman (1987): , Chapter 7, Addison Wesley Publishing Company,  
, Gottfried Vossen (2001): , Chapter 19, Elsevier,  
Philip A. Bernstein, Eric Newcomer (2009): , Chapter 8, Morgan Kaufmann (Elsevier),  
, Bruce Lindsay and R. Obermarck (1986): ,ACM Transactions on Database Systems (TODS), Volume 11 Issue 4, Dec. 1986, Pages 378 - 396
, Bruce Lindsay (1985): ,ACM SIGOPS Operating Systems Review, 19(2),pp. 40-52 (April 1985)
(1995): ,Database Theory — ICDT '95, Lecture Notes in Computer Science, Volume 893/1995, pp. 162-176, Springer,  
by exploreDatabase.docx is locked for editing - Microsoft Community
Site Feedback
Tell us about your experience with our site
Every time I open an existing .docx document it opens the file but it also wants to opens a new word doc with the message "file in use", .docx is locked for editing by ...
I just cancel and close this and go to the orginal document and could work on it but that second page is annoying.
Thank you.
See the article "I keep getting files that I am working on locked for editing. Word only allows me to open them read-only” at:
Hope this helps,Doug Robbins - Word MVP dougrobbinsmvp@gmail.comI AM NOT CONCERNED ABOUT MY EMAIL ADDRESS BEING VISIBLE!!!!
Did this solve your problem?
Sorry this didn't help.
This site in other languagesHowTo: Create a local environment using MAMP | Drupal.org

我要回帖

更多关于 vscode document this 的文章

 

随机推荐