Results 1  10
of
115
Essence: A Resource Discovery System Based on Semantic File Indexing
 Proceedings of the USENIX Winter Conference
, 1993
"... Discovering different types of file resources (such as documentation, programs, and images) in the vast amount of data contained within network file systems is useful for both users and system administrators. In this paper we discuss the Essence resource discovery system, which exploits file semanti ..."
Abstract

Cited by 37 (4 self)
 Add to MetaCart
Discovering different types of file resources (such as documentation, programs, and images) in the vast amount of data contained within network file systems is useful for both users and system administrators. In this paper we discuss the Essence resource discovery system, which exploits file semantics to index both textual and binary files. By exploiting semantics, Essence extracts keywords that summarize a file, and generates a compact yet representative index. Essence understands nested file structures (such as uuencoded, compressed, "tar" files), and recursively unravels such files to generate summaries for them. These features allow Essence to be used in a number of useful settings, such as anonymous FTP archives. We present measurements of our prototype and compare them to related projects, such as the Wide Area Information Servers (WAIS) system and the MIT Semantic File System (SFS). We demonstrate that Essence can index more data types, generate smaller indexes, and in some case...
Sparse Matrix Computations on Parallel Processor Arrays
 SIAM J. SCI. COMPUT
, 1992
"... We investigate the balancing of distributed compressed storage of large sparse matrices on a massively parallel computer. For fast computation of matrixvector and matrixmatrix products on a rectangular processor array with efficient communications along its rows and columns we require that the non ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
(Show Context)
We investigate the balancing of distributed compressed storage of large sparse matrices on a massively parallel computer. For fast computation of matrixvector and matrixmatrix products on a rectangular processor array with efficient communications along its rows and columns we require that the nonzero elements of each matrix row or column be distributed among the processors located within the same array row or column, respectively. We construct randomized packing algorithms with such properties, and we prove that with high probability they produce wellbalanced storage for sufficiently large matrices with bounded number of nonzeros in each row and column, but no other restrictions on structure. Then we design basic matrixvector multiplication routines with fully parallel interprocessor communications and intraprocessor gather and scatter operations. Their efficiency is demonstrated on the 16,384processor MasPar computer.
A Formal Model and Specification Language for Procedure Calling Conventions
 In Conference Record of the 22nd Annual ACM Symposium on Principles of Programming Languages
, 1994
"... Procedure calling conventions are used to provide uniform procedure call interfaces. Applications, such as compilers and debuggers, which generate, or process procedures at the machinelanguage abstraction level require knowledge of the calling convention. In this paper, we develop a formal model fo ..."
Abstract

Cited by 35 (9 self)
 Add to MetaCart
(Show Context)
Procedure calling conventions are used to provide uniform procedure call interfaces. Applications, such as compilers and debuggers, which generate, or process procedures at the machinelanguage abstraction level require knowledge of the calling convention. In this paper, we develop a formal model for procedure calling conventions called PFSA's. Using this model, we are able to ensure several completeness and consistency properties of calling conventions. Currently, applications that manipulate procedures implement conventions in an adhoc manner. The resulting code is complicated with details, difficult to maintain, and often riddled with errors. To alleviate the situation, we introduce a calling convention specification language, called CCL. The combination of CCL and PFSA's facilitates the accurate specification of conventions that can be shown to be both consistent and complete. 1 Introduction Procedures, or functions, in programming languages work in concert to implement the in...
Integer Priority Queues with Decrease Key in . . .
 STOC'03
, 2003
"... We consider Fibonacci heap style integer priority queues supporting insert and decrease key operations in constant time. We present a deterministic linear space solution that with n integer keys support delete in O(log log n) time. If the integers are in the range [0,N), we can also support delete i ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
(Show Context)
We consider Fibonacci heap style integer priority queues supporting insert and decrease key operations in constant time. We present a deterministic linear space solution that with n integer keys support delete in O(log log n) time. If the integers are in the range [0,N), we can also support delete in O(log log N) time. Even for the special case of monotone priority queues, where the minimum has to be nondecreasing, the best previous bounds on delete were O((log n) 1/(3−ε) ) and O((log N) 1/(4−ε)). These previous bounds used both randomization and amortization. Our new bounds a deterministic, worstcase, with no restriction to monotonicity, and exponentially faster. As a classical application, for a directed graph with n nodes and m edges with nonnegative integer weights, we get single source shortest paths in O(m + n log log n) time, or O(m + n log log C) ifC is the maximal edge weight. The later solves an open problem of Ahuja, Mehlhorn, Orlin, and
Hardware support for unbounded transactional memory
 Master’s thesis, MIT
, 2004
"... by ..."
(Show Context)
Software Model Checking
 IN PROCEEDING FORTE 1999
, 1999
"... In these notes we will review the automatatheoretic verification method and propositional linear temporal logic, with specific emphasis on their potential application to distributed software verification. An important ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
In these notes we will review the automatatheoretic verification method and propositional linear temporal logic, with specific emphasis on their potential application to distributed software verification. An important
An Automatic Verification Tool for UML
, 2000
"... The Unified Modeling Language is becoming more and more popular in the software development. However because of its ambiguisity in its semantic model, few verification tool has been built. Abstract State Machines have been successfully applied in giving semantics for programming language like C. ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
(Show Context)
The Unified Modeling Language is becoming more and more popular in the software development. However because of its ambiguisity in its semantic model, few verification tool has been built. Abstract State Machines have been successfully applied in giving semantics for programming language like C. In this report, we try to use the Abstract State Machines to give a semantics model for UML and then use ASM Model Checker to design a verification tool for UML. Last we give a toy example to show how the verification tool works.
Software Analysis and Model Checking
 Proceedings of the 14 th International Conference on Computer Aided Verification (CAV), Lecture Notes in Computer Science 2404
, 2002
"... ..."
Programming with Exceptions in JCilk
, 2006
"... JCilk extends the serial subset of the Java language by importing the forkjoin primitives spawn and sync from the Cilk multithreaded language, thereby providing callreturn semantics for multithreaded subcomputations. In addition, JCilk transparently integrates Java’s exception handling with multit ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
JCilk extends the serial subset of the Java language by importing the forkjoin primitives spawn and sync from the Cilk multithreaded language, thereby providing callreturn semantics for multithreaded subcomputations. In addition, JCilk transparently integrates Java’s exception handling with multithreading by extending the semantics of Java’s try