Processing Method of Rectangular Unequal Distance Thread

Greedy algorithms for packing unequal circles into a rectangular container

In this paper, we study the problem of packing unequal circles into a 2D rectangular container. We solve this problem by proposing two greedy algorithms. The first algorithm, denoted by B1.0, selects the next circle to place according to the maximum hole degree rule, which is inspired from human activity in packing. The second algorithm, denoted by B1.5, improves B1.0 with a self look-ahead sea...

Thread Thread Thread Thread Thread Thread �

We present the design and implementation of Arachne, a threads system that can be interfaced with a communications library for multi-threaded distributed computations. In particular, Arachne supports thread migration between heterogeneous platforms, with dynamic stack size management and recursive thread functions. Arachne is eecient, exible and portable | it is based entirely on C and C++. To ...

Second - level Instruction Cache Thread Processing Unit Thread Processing Unit Thread Processing Unit Instruction Cache First - level First - level First - level Instruction Cache Instruction Cache Execution

This paper presents a new parallelization model, called coarse-grained thread pipelining, for exploiting speculative coarse-grained parallelism from general-purpose application programs in shared-memory multiprocessor systems. This parallelization model, which is based on the ne-grained thread pipelining model proposed for the superthreaded architecture 11, 12], allows concurrent execution of l...

Midface Thread Lifting: Method of Internal Suturing

Indexing the Distance: An Efficient Method to KNN Processing

In this paper, we present an eÆcient method, called iDistance, for K-nearest neighbor (KNN) search in a high-dimensional space. iDistance partitions the data and selects a reference point for each partition. The data in each cluster are transformed into a single dimensional space based on their similarity with respect to a reference point. This allows the points to be indexed using a B-tree str...