ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 449 of 1,394,228
|
|
Results 1 - 20 of 449
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
1
|
|
2
|
|
Non-integral event timing for digital logic simulation
|
|
June 1976
|
|
DAC '76: Proceedings of the 13th Design Automation Conference
|
Publisher: ACM
 Request Permissions
|
|
Full text available: |
 Pdf
(623.70 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 2, Downloads (12 Months): 7, Downloads (Overall): 83, Citation Count: 2 |
 |
|
Due to reasons of efficiency, digital logic simulation is normally performed by restricting timing accuracy to integral event timing. However, this restriction causes disadvantages which can be avoided if a sufficiently efficient event processing algorithm ...
|
|
3
|
|
On RAM priority queues
|
|
January 1996
|
|
SODA '96: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
|
|
Publisher: Society for Industrial and Applied Mathematics
|
|
Full text available: |
Pdf
(1.05 MB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 12, Downloads (12 Months): 55, Downloads (Overall): 358, Citation Count: 17 |
|
|
|
|
|
4
|
|
An algebraic manipulator using SLIP
|
|
January 1966
|
|
SYMSAC '66: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(234.85 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 0, Downloads (12 Months): 5, Downloads (Overall): 54, Citation Count: 0 |
|
|
A notation for representing algebraic expressions to be manipulated by a SLIP type list processor is described in detail. This notation allows Fortran type algebraic expressions to be represented in the form of list structures which will be used in a ...
|
|
5
|
|
6
|
|
Local correction of mod(k) lists
|
|
March 1990
|
|
Journal of Systems and Software
, Volume 11 Issue 3
|
|
Publisher: Elsevier Science Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
7
|
|
Knotted list structures
|
|
January 1961
|
|
Proceedings of the 1961 16th ACM national meeting
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(168.44 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 2, Downloads (12 Months): 9, Downloads (Overall): 92, Citation Count: 0 |
|
|
In (3) Perlis and Thornton describe a list structure language the central innovation of which is that the last word of each list specifies the location of the head of the list of which it is the terminal word. They call such list structures threaded ...
|
|
8
|
|
The busy period in the fluid queue
|
|
June 1998
|
|
SIGMETRICS '98/PERFORMANCE '98: Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(1.29 MB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 2, Downloads (12 Months): 39, Downloads (Overall): 292, Citation Count: 14 |
|
|
Consider a fluid queue fed by N on/off sources. It is assumed that the silence periods of the sources are exponentially distributed, whereas the activity periods are generally distributed. The inflow rate of each source, when active, is at least ...
|
Also published in: |
| June 1998 |
SIGMETRICS Performance Evaluation Review |
Volume 26 Issue 1 |
|
|
9
|
|
Randomized parallel speedups for list ranking
|
|
June 1987
|
|
Journal of Parallel and Distributed Computing
, Volume 4 Issue 3
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
10
|
|
Parallelism in tape-sorting
|
|
April 1974
|
|
Communications of the ACM
, Volume 17 Issue 4
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(271.62 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 1, Downloads (12 Months): 12, Downloads (Overall): 114, Citation Count: 9 |
|
|
Two methods for employing parallelism in tape-sorting are presented. Method A is the natural way to use parallelism. Method B is new. Both approximately achieve the goal of reducing the processing time by a divisor which is the number of processors.
Keywords: external sorting, parallelism, queues, stacks, tape sorting
|
|
11
|
|
Lock-free deques and doubly linked lists
|
|
July 2008
|
|
Journal of Parallel and Distributed Computing
, Volume 68 Issue 7
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
We present a practical lock-free shared data structure that efficiently implements the operations of a concurrent deque as well as a general doubly linked list. The implementation supports parallelism for disjoint accesses and uses atomic primitives ...
Keywords: Concurrent, Deque, Doubly linked list, Lock-free, Multi-thread, Non-blocking, Shared data structure
|
|
12
|
|
Even Better DCAS-Based Concurrent Deques
|
|
October 2000
|
|
DISC '00: Proceedings of the 14th International Conference on Distributed Computing
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 8 |
|
|
|
|
|
13
|
|
Approximate Fair Allocation of Link Bandwidth
|
|
January 2003
|
|
IEEE Micro
, Volume 23 Issue 1
|
|
Publisher: IEEE Computer Society Press
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
Approximate fair dropping (AFD), an active queue management scheme, allocates link bandwidth in an approximately fair manner. AFD-NFT, an enhancement to AFD, performs similarly and is much easier to implement.
|
|
14
|
|
Bounded capacity priority queues
|
|
August 1997
|
|
Theoretical Computer Science
, Volume 182 Issue 1-2
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
|
|
|
15
|
|
An adaptive packed-memory array
|
|
June 2006
|
|
PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(171.33 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 5, Downloads (12 Months): 26, Downloads (Overall): 285, Citation Count: 2 |
|
|
The packed-memory array (PMA) is a data structure that maintains a dynamic set of N elements in sorted order in a Θ(N)-sized array. The idea is to intersperse Θ(N) empty spaces or gaps among the elements so ...
Keywords: adaptive packed-memory array, cache oblivious, locality preserving, packed-memory array, range query, rebalance, sequential file maintenance, sequential scan, sparse array
|
|
16
|
|
A dynamic-sized nonblocking work stealing deque
|
|
February 2006
|
|
Distributed Computing
, Volume 18 Issue 3
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (hencheforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of choice in both industry and academia. This highly efficient scheme is based ...
Keywords: concurrent programming, data structures, load balancing, lock-free, work stealing
|
|
17
|
|
Reducing list access time for LISP execution
|
|
January 1989
|
|
Reducing list access time for LISP execution
|
|
Publisher: University of Illinois, Department of Computer Science
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
|
|
|
18
|
|
Using Hindley-Milner type inference to optimise list representation
|
|
July 1994
|
|
LFP '94: Proceedings of the 1994 ACM conference on LISP and functional programming
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(809.68 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 10, Downloads (12 Months): 35, Downloads (Overall): 247, Citation Count: 7 |
|
|
Lists are a pervasive data structure in functional programs. The generality and simplicity of their structure makes them expensive. Hindley-Milner type inference and partial evaluation are all that is needed to optimise this structure, yielding considerable ...
|
Also published in: |
| July 1994 |
SIGPLAN Lisp Pointers |
Volume VII Issue 3 |
|
|
19
|
|
The role of the data structures course in the computing curriculum
|
|
December 2003
|
|
Journal of Computing Sciences in Colleges
, Volume 19 Issue 2
|
|
Publisher: Consortium for Computing Sciences in Colleges
|
|
Full text available: |
Pdf
(16.80 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 3, Downloads (12 Months): 17, Downloads (Overall): 160, Citation Count: 4 |
|
|
|
|
|
20
|
|
Incremental updates of inverted lists for text document retrieval
|
|
June 1994
|
|
SIGMOD '94: Proceedings of the 1994 ACM SIGMOD international conference on Management of data
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(1.39 MB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 13, Downloads (12 Months): 70, Downloads (Overall): 598, Citation Count: 45 |
|
|
With the proliferation of the world's “information highways” a renewed interest in efficient document indexing techniques has come about. In this paper, the problem of incremental updates of inverted lists is addressed using a new dual-structure ...
|
Also published in: |
| June 1994 |
SIGMOD Record |
Volume 23 Issue 2 |
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Refine by Keywords
Save results to a Binder
Publisher Site