216:
79:
179:
43:
section that describes the type of the data: how it is to be interpreted, and, if it is a reference, the type of the object that it points to.
220:
105:) 15-bit integer. Current Intel documentation mentions that the lower bits of a memory address might be similarly used by some
283:
174:
246:
129:
52:
106:
75:
71:
94:
28:
153:
134:
166:
83:
113:
16:
Type of computer architecture where tag sections in words in memory describe the type of data
205:
98:
74:, which have a data-driven tagged and descriptor-based architecture, and the non-commercial
32:
20:
264:
97:
of each 16-bit word as a tag bit: if it was clear then the hardware would accept it as an
117:
63:
277:
55:, making the way the memory is referenced critical to interpret the correct meaning.
59:
36:
250:
102:
90:
67:
51:
In contrast, program and data memory are indistinguishable in the
58:
Notable examples of
American tagged architectures were the
213:
Proceedings of the 1972 Spring Joint
Computer Conference
101:
memory address while if it was set it was treated as a (
217:
American
Federation of Information Processing Societies
78:. Both the Burroughs and Lisp machine are examples of
206:"The Rice Research Computer -- A tagged architecture"
39:, being divided into a number of bits of data, and a
82:, where the tagging is used to support types from a
154:
The Memory
Management Glossary: Tagged architecture
120:pioneered the use of tagged architectures in 1973.
247:"A Brief History of the Rice Computer 1959-1971"
263:(mostly written in 1994, and archived by the
8:
167:"On the Advantages of Tagged Architecture"
80:high-level language computer architectures
226:from the original on September 24, 2015
146:
7:
89:In addition to this, the original
14:
185:from the original on May 23, 2013
267:on a date indicated in the URL)
165:Feustel, Edward A. (July 1973).
175:IEEE Transactions on Computers
1:
66:support at the hardware and
219:(AFIPS). pp. 369–377.
204:Feustel, Edward A. (1972).
130:Executable-space protection
300:
112:In the Soviet Union, the
93:implementation used the
53:von Neumann architecture
35:of memory constitutes a
86:at the hardware level.
72:Burroughs large systems
284:Computer architecture
95:least-significant bit
29:computer architecture
253:on February 24, 2008
135:Harvard architecture
84:high-level language
25:tagged architecture
291:
268:
262:
260:
258:
249:. Archived from
245:Thornton, Adam.
242:
236:
235:
233:
231:
225:
210:
201:
195:
194:
192:
190:
184:
171:
162:
156:
151:
109:-based systems.
21:computer science
299:
298:
294:
293:
292:
290:
289:
288:
274:
273:
272:
271:
265:Wayback Machine
256:
254:
244:
243:
239:
229:
227:
223:
208:
203:
202:
198:
188:
186:
182:
169:
164:
163:
159:
152:
148:
143:
126:
91:Xerox Smalltalk
49:
17:
12:
11:
5:
297:
295:
287:
286:
276:
275:
270:
269:
237:
196:
157:
145:
144:
142:
139:
138:
137:
132:
125:
122:
118:supercomputers
64:tagged pointer
48:
45:
15:
13:
10:
9:
6:
4:
3:
2:
296:
285:
282:
281:
279:
266:
252:
248:
241:
238:
222:
218:
214:
207:
200:
197:
181:
177:
176:
168:
161:
158:
155:
150:
147:
140:
136:
133:
131:
128:
127:
123:
121:
119:
115:
110:
108:
104:
100:
96:
92:
87:
85:
81:
77:
76:Rice Computer
73:
69:
65:
61:
60:Lisp machines
56:
54:
46:
44:
42:
38:
34:
30:
27:is a type of
26:
22:
255:. Retrieved
251:the original
240:
228:. Retrieved
212:
199:
187:. Retrieved
173:
160:
149:
111:
88:
62:, which had
57:
50:
47:Architecture
40:
37:tagged union
31:where every
24:
18:
257:January 31,
189:January 21,
178:: 644–656.
107:interpreter
70:level, the
141:References
116:series of
278:Category
230:July 27,
221:Archived
180:Archived
124:See also
103:shifted
99:aligned
114:Elbrus
68:opcode
224:(PDF)
209:(PDF)
183:(PDF)
170:(PDF)
259:2013
232:2014
191:2013
33:word
23:, a
41:tag
19:In
280::
215:.
211:.
172:.
261:.
234:.
193:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.