ACM Home Page

Searching within The Guide for: Keywords:"deadlock"  (start a new search)

Found 446 of 1,394,228

REFINE YOUR SEARCH

ADVANCED SEARCH
Advanced search.  Advanced Search

FEEDBACK
Please provide us with feedback. Please provide us with feedback

Found 446 of 1,394,228

Results 1 - 20 of 446
Sort by in
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>
1
Inference of Message Sequence Charts
July 2003
IEEE Transactions on Software Engineering , Volume 29 Issue 7
Publisher: IEEE Press
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1

Abstract¿Software designers draw Message Sequence Charts for early modeling of the individual behaviors they expect from the concurrent system under design. Can they be sure that precisely the behaviors they have described are realizable by some implementation ...


Keywords: Message sequence charts, requirements analysis, formal verification, scenarios, concurrent state machines, deadlock freedom, realizability, synthesis.
2
A deadlock prevention approach for flexible manufacturing systems without complete siphon enumeration of their Petri net models
Chunfu Zhong, Zhiwu Li
August 2009
Engineering with Computers , Volume 25 Issue 3
Publisher: Springer-Verlag
Additional Information:full citation, abstract
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Siphons are very important in the analysis and control of deadlocks in a Petri net. However, it is quite time-consuming or even impossible to get the complete siphon enumeration of a Petri net. This paper focuses on the deadlock prevention problems in ...


Keywords: Deadlock prevention, Flexible manufacturing system, Petri net, S4PR, Siphon
3
Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe petri nets
February 1999
Fundamenta Informaticae , Volume 37 Issue 3
Publisher: IOS Press
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 8

Keywords: deadlock checking, logic programs, petri nets, reachability, verification
4
Compositional reasoning about projected and infinite time
November 1995
ICECCS '95: Proceedings of the 1st International Conference on Engineering of Complex Computer Systems
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, cited by
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 2

Modularity is of fundamental importance in computer science. The need for a formal theory of modularity in the design and maintenance of large systems is especially pronounced. In recent work on Interval Temporal Logic (ITL) we gave an axiom system in ...


Keywords: Interval Temporal Logic, assumptions, commitments, concurrency, concurrency control, concurrent system, deadlock, multiple time granularities, multiprocessing systems, parallel programming, temporal logic, theorem proving
5
A low level analysis of the realtime Mach distributed operating system
May 1995
RTAS '95: Proceedings of the Real-Time Technology and Applications Symposium
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

The use of measuring techniques to assist in the process of evaluation has always been a speculative endeavor. There is the presence of doubt as to what should be measured, and once this measurable entity has been determined, then what constitutes proper ...


Keywords: Rhealstone benchmark, conditioned environment, deadlock breaking time, distributed processing, evaluation, interprocess communication latency time, interrupt latency time, low level analysis, measuring techniques, network operating systems, operating systems (computers), preemption time, real-time Mach distributed operating system, real-time operating system software development arena, real-time systems, segmented appraisal, semaphore shuffling time, software performance evaluation, specific element analysis, task switch time
6
Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation
November 1994
SFCS '94: Proceedings of the Proceedings 35th Annual Symposium on Foundations of Computer Science - Volume 00 , Volume 00
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1

The work is motivated by deadlock resolution and resource allocation problems, occurring in distributed server-client architectures. We consider a very general setting which includes, as special cases, distributed bandwidth management in communication ...


Keywords: minimum fractional coloring, local optimization, global objectives, competitive distributed deadlock resolution, resource allocation, distributed server-client architectures, distributed bandwidth management, communication networks, distributed computing, communication networking, globally-optimum performance, maximum fractional independent set, admission control, network throughput, job scheduling
7
A multithreaded scheduler for a high-speed spacecraft simulator
May 1998
Software—Practice & Experience , Volume 28 Issue 6
Publisher: John Wiley & Sons, Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Keywords: deadlock, multiprocessing, multithreaded, object-oriented, scheduling policy, simulation
8
Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths
January 1999
IEEE Transactions on Parallel and Distributed Systems , Volume 10 Issue 1
Publisher: IEEE Press
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 22

Abstract¿This paper proposes multidestination message passing on wormhole k-ary n-cube networks using a new base-routing-conformed-path (BRCP) model. This model allows both unicast (single-destination) and multidestination messages to co-exist in a given ...


Keywords: Wormhole routing, collective communication, broadcast, multicast, k-ary n-cubes, meshes, interconnection networks, deadlock-freedom, and interprocessor communication.
9
Routing Schemes of an Irregular Mesh-Based NoC
April 2009
NSWCTC '09: Proceedings of the 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 02 , Volume 02
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Topology selection is an important issue for the design of network on chip systems. At present, typical application-specific NoC systems often integrate a number of heterogeneous components which have varied functions, sizes and communication requirements. ...


Keywords: network on chip, routing algorithm, deadlock-free, irregular mesh
10
High-Performance Routing in Networks of Workstations with Irregular Topology
July 2000
IEEE Transactions on Parallel and Distributed Systems , Volume 11 Issue 7
Publisher: IEEE Press
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 9

Abstract¿Networks of workstations are rapidly emerging as a cost-effective alternative to parallel computers. Switch-based interconnects with irregular topology allow the wiring flexibility, scalability, and incremental expansion capability required ...


Keywords: Networks of workstations, irregular topologies, wormhole switching, deadlock avoidance, adaptive routing.
11
Designing efficient irregular networks for heterogeneous systems-on-chip
March 2008
Journal of Systems Architecture: the EUROMICRO Journal , Volume 54 Issue 3-4
Publisher: Elsevier North-Holland, Inc.
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Networks-on-chip will serve as the central integration platform in future complex systems-on-chip (SoC) designs, composed of a large number of heterogeneous processing resources. Most researchers advocate the use of traditional regular networks like ...


Keywords: Custom architecture, Deadlock, Network-on-chip, Routing algorithm, Topology synthesis
12
Formal Approaches to Deadlock Analysis in Competitions of Shared Web Resources
Jieqi Ding, Han Zhu, Huibiao Zhu, Qin Li
July 2009
TASE '09: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering - Volume 00 , Volume 00
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Competitions of shared web resources have been widely concerned today. Under the circumstances of networks, no central supervisor can be implemented, which makes it more complicated to avoid deadlock problems. This paper describes the interactions of ...


Keywords: Deadlock, Shared web resources, CSP
13
Asynchronous Tree-Based Multicasting in Wormhole-Switched MINs
November 1999
IEEE Transactions on Parallel and Distributed Systems , Volume 10 Issue 11
Publisher: IEEE Press
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 2

Abstract¿Multicast operation is an important operation in multicomputer communication systems and can be used to support several collective communication operations. A significant performance improvement can be achieved by supporting multicast operations ...


Keywords: Asynchronous tree-based multicasting, multistage interconnection networks, deadlock configurations, multicast routing algorithm, wormhole switching.
14
Deadlock prevention in a communications shell using empty slots
August 1991
Microprocessing and Microprogramming , Volume 33 Issue 1
Publisher: Elsevier Science Publishers B. V.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Keywords: deadlock, empty slot, processor farm, topology, transputer
15
A Distributed Deadlock Detection and Resolution Algorithm and its Correctness Proof
October 1988
IEEE Transactions on Software Engineering , Volume 14 Issue 10
Publisher: IEEE Press
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 6

The key idea of the algorithm is to let one transaction controller be in charge of all transactions in a set of interacting transactions. Two transactions are interacting if they are both interested in (accessing) the same resource. In addition, the ...


Keywords: communicating sequential processes, correctness proof, distributed deadlock detection, distributed processing, program verification, programming theory, system recovery, transaction controller, transaction processing
16
Performance Impact of Coarse Timer Granularities on QoS Guarantees in Unix-Based Systems
January 2003
IEEE Transactions on Computers , Volume 52 Issue 1
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Abstract¿Owing to the Internet's rapid expansion and fast advancing PC technology, there are many PC-based network systems now. For increasingly many applications running over the Internet, guaranteeing QoS on these PC-based systems has become an issue ...


Keywords: Packet scheduler, timer granularity, TCP deadlock.
17
Correction to 'A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution'
December 1989
IEEE Transactions on Software Engineering , Volume 15 Issue 12
Publisher: IEEE Press
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, references
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

A line inadvertently omitted from a section of the pseudocode in the paper is provided. The correct reading of the section is given in full.


Keywords: distributed deadlock detection, distributed processing, error correction, modified priority based probe algorithm, pseudocode, system recovery
18
Requirements for Deadlock-Free, Adaptive PacketRouting
December 1994
SIAM Journal on Computing , Volume 23 Issue 6
Publisher: Society for Industrial and Applied Mathematics
Additional Information:full citation, abstract, cited by, index terms, review
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 5

This paper studies the problem of deadlock-free packet routing in parallel and distributed architectures. Three main results are presented. First, it is shown that the standard technique of ordering the buffers so that every packet always has the possibility ...


Keywords: adaptive routing, buffer requirements, deadlock, lower bounds, networks, packet routing, parallel algorithms, store-and-forward routing
19
Subcube allocation and task migration in hypercube multiprocessors
June 1994
Interconnection networks for high-performance parallel computers
Publisher: IEEE Computer Society Press
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Keywords: binary reflected Gray code, deadlock, fragmentation, hypercube computers, stepwise adjoint, subcube recognition ability, task migration
20
On Mechanisms for Deadlock Avoidance in SIP Servlet Containers
October 2008
Principles, Systems and Applications of IP Telecommunications. Services and Security for Next Generation Networks
Publisher: Springer-Verlag
Additional Information:full citation, abstract
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1

Increasingly, VoIP applications are being deployed to multi-threaded SIP servlet containers. Unfortunately, the standard specification for these containers is silent with regard to synchronization issues, and the lack of direction has led different vendors ...


Keywords: Concurrency, SIP, converged container, deadlock prevention, negotiation, servlet, synchronization contract
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>