Sciweavers

6584 search results - page 1168 / 1317
» Distributed Shared Contexts
Sort
View
HPCA
1999
IEEE
15 years 10 months ago
Dynamically Exploiting Narrow Width Operands to Improve Processor Power and Performance
In general-purpose microprocessors, recent trends have pushed towards 64-bit word widths, primarily to accommodate the large addressing needs of some programs. Many integer proble...
David Brooks, Margaret Martonosi
ICPP
1999
IEEE
15 years 10 months ago
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
William Leinberger, George Karypis, Vipin Kumar
IPPS
1999
IEEE
15 years 10 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
ISHPC
1999
Springer
15 years 10 months ago
Utilization of Cache Area in On-Chip Multiprocessor
On-chip multiprocessor can be an alternative to the wide-issue superscalar processor approach which is currently the mainstream to exploit the increasing number of transistors on ...
Hitoshi Oi, N. Ranganathan
ICPP
1998
IEEE
15 years 10 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
« Prev « First page 1168 / 1317 Last » Next »