Resource Sharing and Dedicated Hardware

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/165

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 3:03 AM on 9/6/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

166 Terms

1
New cards

Resource Sharing

Using one hardware resource for multiple operations or time slots instead of constructing a dedicated copy for every possible use.

2
New cards

Dedicated Hardware

A hardware organization in which separate resources are provided for separate operations or consumers.

3
New cards

Shared Hardware

A hardware organization in which multiple operations or consumers use the same physical resource at different permitted times.

4
New cards

Dedicated Resource

A hardware unit reserved for a particular function, operation, or concurrent use.

5
New cards

Shared Resource

A hardware unit whose use must be coordinated among multiple possible operations or consumers.

6
New cards

Reuse

The architectural use of the same physical hardware resource for more than one required computation or time slot.

7
New cards

Resource Duplication

Constructing additional physical copies of a hardware resource instead of reusing one shared instance.

8
New cards

Dedicated vs. Shared

The architectural choice between duplicating hardware for independent use and coordinating reuse of a smaller number of resources.

9
New cards

Resource sharing trades hardware duplication for scheduling and coordination.

What is the central architectural tradeoff of shared hardware?

10
New cards

Sharing reduces the need for multiple copies of the core resource but introduces supporting logic and temporal constraints.

Why is shared hardware not simply “the same design with fewer components”?

11
New cards

Space for Scheduling

Replacing some simultaneously existing hardware with coordinated use of hardware over time.

12
New cards

Reuse trades space for scheduling.

What concise principle summarizes the Part 10 resource-sharing tradeoff?

13
New cards

Temporal Reuse

Using the same hardware resource during different time intervals for different pieces of work.

14
New cards

Spatial Duplication

Providing multiple physical copies so separate pieces of work can be supported simultaneously.

15
New cards

Temporal reuse and spatial duplication are alternative ways to allocate hardware capability.

How are resource sharing and dedicated hardware related to space and time?

16
New cards

A dedicated architecture spends more space to reduce the need for temporal sharing.

What space-time tendency characterizes dedicated resources?

17
New cards

A shared architecture uses time to allow fewer physical resources to serve multiple needs.

What space-time tendency characterizes shared resources?

18
New cards

One adder used for both A+B and C+D at different times.

What is a simple example of resource sharing?

19
New cards

Two separate adders, one for A+B and one for C+D.

What is the corresponding dedicated-hardware example?

20
New cards

Both operations can have their own physical arithmetic path.

What capability does the two-adder dedicated architecture provide?

21
New cards

The two operations must be routed and scheduled through one physical adder.

What additional requirement appears when those operations share one adder?

22
New cards

Input Selection

Choosing which candidate operands are currently routed into a shared resource.

23
New cards

A mux is commonly needed before a shared arithmetic resource.

Why does resource sharing often introduce multiplexers?

24
New cards

Destination Routing

Directing the result of a shared resource to the correct consumer or storage destination.

25
New cards

Sharing may require output routing as well as input selection.

Why can one shared arithmetic unit need more than just an input mux?

26
New cards

Shared-Resource Control

Control logic that determines which operation may use a shared resource and how its data path is configured.

27
New cards

Scheduling

The architectural decision of when each competing use of a shared resource is allowed to occur.

28
New cards

Resource Schedule

A plan or control sequence specifying which operation owns a shared resource at each relevant time.

29
New cards

When hardware is shared, time becomes part of the allocation problem.

What is the ATHENA design lightbulb for resource sharing?

30
New cards

Allocation

The assignment of a limited hardware resource to a particular operation or consumer.

31
New cards

Resource Allocation

Deciding which requester receives access to shared hardware at a given time.

32
New cards

Resource Ownership

The condition that identifies which operation currently has permission to use a shared resource.

33
New cards

A shared resource must have unambiguous ownership when conflicting uses are possible.

Why is ownership important in resource sharing?

34
New cards

Contention

A situation in which multiple operations require the same shared resource at the same time.

35
New cards

Contention is created by overlapping demand for a resource that cannot serve all requesters simultaneously.

What causes shared-resource contention?

36
New cards

Dedicated resources can avoid contention between operations that use separate hardware copies.

What contention advantage can dedicated hardware provide?

37
New cards

Sharing can create contention that did not exist when resources were duplicated.

What new architectural problem may appear after two dedicated units are replaced by one shared unit?

38
New cards

Conflict

A simultaneous demand pattern in which multiple potential users cannot all be served by the shared resource.

39
New cards

Conflict Resolution

The architectural mechanism that decides what happens when multiple operations compete for a shared resource.

40
New cards

Arbitration

Choosing which competing requester receives access to a shared resource.

41
New cards

An arbiter may be needed when several independent requesters can contend unpredictably for one resource.

When can sharing require arbitration rather than a fixed schedule?

42
New cards

Priority Arbitration

A conflict-resolution policy in which one requester is favored according to predefined priority.

43
New cards

Round-Robin Arbitration

A conflict-resolution policy that rotates access among competing requesters to improve fairness.

44
New cards

Fixed Scheduling

A resource-sharing strategy in which access times are predetermined rather than dynamically arbitrated.

45
New cards

Static Resource Sharing

Sharing governed by a known schedule or deterministic control sequence.

46
New cards

Dynamic Resource Sharing

Sharing in which access must be decided at runtime according to requests or availability.

47
New cards

If two uses are known never to occur simultaneously, a simple static sharing scheme may be sufficient.

When can resource sharing require little or no complex arbitration?

48
New cards

If multiple independent operations can request the resource unpredictably, more explicit arbitration may be required.

When does shared-resource control become more complex?

49
New cards

Mutual Exclusion

The guarantee that only one conflicting user controls a non-multiported shared resource at a time.

50
New cards

Why is mutual exclusion important for a shared arithmetic unit?

Two conflicting operations cannot safely command the same single-use resource simultaneously.

51
New cards

Resource Conflict Rule

A design rule defining what happens when multiple users request a shared resource together.

52
New cards

Wait, defer, reject, prioritize, or forbid concurrency.

What kinds of policies can resolve a shared-resource conflict?

53
New cards

Serialization

Forcing operations that could otherwise conceptually overlap to use a shared resource one after another.

54
New cards

Resource sharing can serialize work.

What timing consequence can arise when multiple operations depend on the same shared unit?

55
New cards

Serialization Cost

The additional delay or reduced concurrency caused by forcing work through one shared resource sequentially.

56
New cards

Dedicated hardware can avoid serialization when separate copies can operate simultaneously.

What performance advantage can hardware duplication provide?

57
New cards

Sharing reduces hardware duplication but can reduce available concurrency.

What fundamental tradeoff exists between sharing and dedicated resources?

58
New cards

Concurrency Loss

A reduction in the amount of work that can happen simultaneously because multiple tasks depend on one shared resource.

59
New cards

Resource sharing can convert potential parallel work into scheduled sequential work.

What effect can sharing have on concurrency?

60
New cards

Resource Availability

Whether a shared hardware unit is currently free to accept another use.

61
New cards

An operation may have to wait if the shared resource is occupied.

How can resource availability affect scheduling?

62
New cards

Resource Occupancy

The interval during which a shared resource is committed to one operation.

63
New cards

Longer resource occupancy increases the chance that other potential users must wait.

How does occupancy affect contention?

64
New cards

Busy Resource

A shared or transactional resource that is currently unavailable for conflicting new work.

65
New cards

BUSY is one possible status signal for exposing resource occupancy.

What type of interface signal can help control shared-resource access?

66
New cards

Availability Feedback

Status information returned to control so that scheduling can respect whether the resource is free.

67
New cards

Resource sharing frequently couples datapath availability to control decisions.

Why can status become more important in a shared architecture?

68
New cards

Scheduling Constraint

A restriction determining when an operation may use a shared resource.

69
New cards

A shared resource introduces scheduling constraints that dedicated copies may avoid.

What timing constraint commonly appears when hardware is shared?

70
New cards

Access Slot

A time interval in which a particular operation is permitted to use a shared resource.

71
New cards

Time Slot Sharing

A sharing scheme in which different users are assigned different access intervals.

72
New cards

Resource sharing can occur across different operations or across repeated steps of one operation.

What two broad forms can temporal resource reuse take?

73
New cards

Inter-Operation Sharing

Using one hardware resource for multiple different operations.

74
New cards

Intra-Operation Sharing

Reusing one hardware resource across repeated steps of the same multi-cycle operation.

75
New cards

Using one adder for two unrelated additions is inter-operation sharing.

What kind of sharing is one adder serving A+B and C+D?

76
New cards

Using one arithmetic structure repeatedly during iterative multiplication is intra-operation sharing.

What kind of sharing occurs in shift-and-add multiplication?

77
New cards

Sequential arithmetic is resource sharing across time.

How does Part 10 reinterpret iterative arithmetic architecturally?

78
New cards

The shift-and-add multiplier repeatedly reuses arithmetic and shift structures rather than constructing all multiplication work simultaneously.

Why is the ATHENA sequential multiplier a strong resource-sharing example?

79
New cards

Iteration

Time-separated repetition that allows one physical resource to perform several stages or pieces of a computation.

80
New cards

Iteration can reduce simultaneously required hardware by reusing the same resource across steps.

What architectural benefit can iterative computation provide?

81
New cards

Iterative Resource Reuse

The use of one hardware structure repeatedly across multiple cycles to complete a larger computation.

82
New cards

The multiplier's repeated arithmetic steps illustrate temporal reuse, not multiple newly created arithmetic units each cycle.

What hardware interpretation should be applied to sequential multiplication?

83
New cards

The same physical resource persists and is used again at later clock intervals.

What does “reuse across iterations” mean physically?

84
New cards

Time-Multiplexed Hardware

Hardware whose function or data source changes over time so one resource serves multiple uses.

85
New cards

Resource sharing is a form of hardware time multiplexing.

How can one physical arithmetic unit support multiple logical operations?

86
New cards

The control system changes which data and operation context are presented to the resource at different times.

How does time-multiplexed hardware switch between uses?

87
New cards

Operand Multiplexing

Selecting which operation's operands feed a shared functional unit.

88
New cards

Result Demultiplexing or Destination Selection

Directing a shared unit's output toward the intended destination.

89
New cards

Sharing Network

The muxing, routing, and control structures required to let multiple users access a common hardware resource.

90
New cards

Sharing Overhead

The additional hardware and control introduced specifically to enable resource reuse.

91
New cards

Muxes, routing, control, state, and arbitration can contribute to sharing overhead.

What structures can add cost to a shared architecture?

92
New cards

The core resource may be reduced while the sharing infrastructure consumes additional hardware.

Why must sharing be evaluated by net architectural cost?

93
New cards

Net Sharing Benefit

The overall architectural advantage after accounting for both eliminated duplication and added sharing overhead.

94
New cards

Reducing two arithmetic units to one does not imply the total design cost is exactly halved.

Why should a designer not assume linear area savings from resource sharing?

95
New cards

The shared architecture still needs selection, routing, and coordination logic.

Why can one shared unit cost more than simply the resource itself?

96
New cards

Control Complexity

The amount of sequencing, selection, arbitration, and state required to coordinate hardware behavior.

97
New cards

Resource sharing can increase control complexity.

What non-area cost often accompanies hardware reuse?

98
New cards

Routing Complexity

The difficulty and resource demand of connecting multiple possible sources and destinations through shared hardware.

99
New cards

Resource sharing can increase routing complexity because more signals may need access to the same resource.

What interconnection cost can sharing introduce?

100
New cards

Selection Complexity

The complexity of choosing the correct operands, mode, and destination for each use of a shared resource.