iTrans.ir
سفارش ترجمه
خانه
راهنما
چگونه سفارش ترجمه دهیم
تماس با ما
ترجمه فوری
راهنمای استفاده از سایت
API
بیشتر...
پرسش و پاسخ
قیمت ترجمه
ثبت نام
ورود
021-66989400
021-66989500
0935-173-0404
نشانی و اطلاعات تماس
تگ thread
جزئیات خدمات ترجمه در ترجمه تخصصی
memory
Solving the straggler problem with bounded staleness
Comparing the Performance of Web Server Architectures
Implementation of a 3GPP LTE Turbo Decoder
Double-precision Floating-point
Massively Parallel
Journal of Engineering Sciences, Assiut University, Vol. 39, No 3, pp.581 -605, May 2011
5.12 CHAPTER FIVE
CHAPTER 5
5.12 CHAPTER FIVE
Deadlocks and Starvation
High-Performance Packet Classification on GPU
High-Performance Packet Classification on GPU
High-Performance Packet Classification on GPU
ONLY THE APPROVED METHODS OF FASTENING DEVICES MUST BE USED
ONLY THE APPROVED METHODS OF FASTENING DEVICES MUST BE USED
The Bw-Tree: A B-tree for New Hardware
Optimistic Recovery in Multi-threaded Distributed Systems
[3B2-14] mmi2010020005.3d 23/3/010 15:43 Page 56
The Interaction of
Model.CM-364 Industrial Blind-stitch Machine same as sewing stitch:
1906 IEEE TRANSACTIONS ON COMPUTERS, VOL. 62, NO. 10, OCTOBER 2013
SEC. 8.1 MULTIPROCESSORS 539
Lawrence Berkeley National Laboratory
3-26 TS POM / Surface Equipment 3-26
you will want to do more of in lots of
AUTEX Research Journal, Vol. 10, No3, September 2010 © AUTEX
AUTEX Research Journal, Vol. 10, No3, September 2010 © AUTEX
AUTEX Research Journal, Vol. 10, No3, September 2010 © AUTEX
AUTEX Research Journal, Vol. 10, No3, September 2010 © AUTEX
AUTEX Research Journal, Vol. 10, No3, September 2010 © AUTEX
Optimistic Recovery in Multi-threaded Distributed Systems
The Journal of Systems and Software 43 (1998) 11–17
The Journal of Systems and Software 43 (1998) 11–17
Efficient Compilation of Fine-Grained SPMD-threaded
The Journal of Systems and Software 43 (1998) 11–17
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for
Surplus F air S c heduling: A P r opor ti onal-Share C PU Sc heduling A lgorithm for
m a in [4 , 6 , 2 2 , 26 ] a ssociate a n intr insic r a te w ith each G P S , w h ile B V T is a der i v a ti v e of S F Q w ith an addi-
Thread 1 Thread 2 Thread 3
m ain [4 , 6 , 2 2 , 26 ] associate an intr insic r ate w ith each G P S , w h ile B V T is a der i v ati v e of S F Q w ith an addi-
Thread 1 Thread 2 Thread 3
From the Proceedings of the 2000 International Conference on Supercomputing, Santa Fe, N.M., May, 2000.
From the Proceedings of the 2000 International Conference on Supercomputing, Santa Fe, N.M., May, 2000.
A Dynamic Multithreading Processor
The Standard Tapered Thread coupler is suitable for connecting two
propose the use of a coprocessor to eliminatethe likely priority
Our solution provides the interrupt controller with awarenessof the currently
Our solution provides the interrupt controller with awarenessof the currently
Our solution provides the interrupt controller with awareness of the
s AIC and differs from traditional Interrupt Controllers since it
CONCLUSION This letter described microarchitectural enhancements to an interrupt controller
GreenPeak White Paper
908 CASE STUDY 2: WINDOWS 8 CHAP. 11
Distributed Systems
Distributed Operating System and Scheduling for MPSoC
Mutual exclusion The simplest way that threads interact is through
Die Head Chaser Management
J.ParallelDistrib. Comput. 73(2013)52–61