What is claimed is:
1. A barrier garment for a wearer, said garment having at least a portion comprising a textile including: a base fabric having a high air permeability and an inner surface disposed toward the wearer, a cover fabric having air permeability with sufficient tightness to be a barrier to insects and an outer surface disposed away from the wearer, and a spacer layer disposed between the base fabric and the cover fabric.
2. The barrier garment according to claim 1, further including a camouflage pattern disposed on at least the outside surface of the cover fabric.
3. The barrier garment according to claim 1, wherein said garment includes a configuration to cover the lower body of the wearer.
4. The barrier garment according to claim 3, wherein said garment includes leg sections with said textile being disposed in said leg sections.
5. The barrier garment according to claim 3, wherein said garment includes a pelvic region with said textile being disposed in said pelvic region.
6. The barrier garment according to claim 1, wherein said garment includes a configuration to cover the upper body of the wearer.
7. The barrier garment according to claim 6, wherein said garment includes arm sections with said textile being disposed in said arm sections.
8. The barrier garment according to claim 6, wherein said garment includes an upper torso region with said textile being disposed in said upper torso region.
9. The barrier garment according to claim 1, wherein said garment includes a configuration to cover the head of the wearer.
10. The barrier garment according to claim 9, wherein said garment includes a veil region to cover the face of the wearer, and wherein said veil region includes only the cover fabric of said textile.
11. The barrier garment according to claim 9, wherein said garment includes a veil region to cover the face of the wearer, and wherein said garment includes the textile having a more open construction in the veil region.
12. The barrier garment according to claim 9, wherein said garment includes a veil region in the area of the face of the wearer, and wherein said veil region is open.
13. The barrier garment according to claim 1, wherein said garment includes a configuration to cover a hand of the wearer.
14. The barrier garment according to claim 13, wherein the configuration of the garment covering the hand of the wearer is a glove.
15. The barrier garment according to claim 13, wherein the configuration of the garment covering the hand of the wearer is a mitten.
16. The barrier garment according to claim 13, wherein said garment includes openings which allow the fingers and thumb of the wearer to extend through the garment.
17. The barrier garment according to claim 13, wherein the garment includes a second material for the portion of the garment covering the fingers of the wearer.
18. The barrier garment according to claim 13, wherein the garment includes a second material for the portion of the garment covering the palm of the wearer.
19. The barrier garment according to claim 1, wherein said base fabric is an open mesh fabric.
20. The barrier garment according to claim 1, wherein said base fabric is a net construction fabric.
21. The barrier garment according to claim 1, wherein said base fabric is a solid construction fabric.
22. The barrier garment according to claim 1, wherein said base fabric is a fabric selected from the group consisting of: woven, knitted, and nonwoven.
23. The barrier garment according to claim 1, wherein said cover fabric is a solid construction fabric.
24. The barrier garment according to claim 1, wherein said cover fabric has open interstices with a maximum passable width of up to about 0.188 inches.
25. The barrier garment according to claim 24, wherein said base fabric has open interstices with a minimum passable width of about 0.188 inches.
26. The barrier garment according to claim 1, wherein said cover fabric has open interstices with a maximum passable width of up to about 0.063 inches.
27. The barrier garment according to claim 26, wherein said base fabric has open interstices with a minimum passable width of up to about 0.063 inches.
28. The barrier garment according to claim 1, wherein said spacer layer connects said base layer and said cover layer.
29. The barrier garment according to claim 1, wherein said spacer layer includes pile yarn connecting the base fabric with the cover fabric.
30. The barrier garment according to claim 1, wherein said spacer layer includes nonwoven batting.
31. The barrier garment according to claim 1, wherein said base fabric, said cover fabric and said spacer layer are sewn together.
32. The barrier garment according to claim 1, wherein said base fabric, said cover fabric and said spacer layer are bonded together.
33. The barrier garment according to claim 1, wherein said base fabric, said cover fabric and said spacer layer are welded together.
34. The barrier garment according to claim 1, wherein the distance between the inside surface of said base fabric and the outside surface of the cover fabric is greater than about one millimeter.
35. The barrier garment according to claim 1, wherein the distance between the inside surface of said base fabric and the outside surface of the cover fabric is at least about two millimeters.
36. The barrier garment according to claim 1, wherein the distance between the inside surface of said base fabric and the outside surface of the cover fabric is between about three millimeters and about seven millimeters.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method, comprising:
retrieving a set of virtual addresses used by an agent;
assigning said virtual addresses to a first set of physical addresses;
generating a first assignment cost value for said assignment; and
reassigning said virtual addresses to a second set of physical addresses using said first assignment cost value.
2. The method of claim 1, wherein said first and second sets of physical addresses correspond to a plurality of memory types.
3. The method of claim 2, wherein said generating comprises:
identifying a number of data objects associated with said agent;
receiving a read rate value and a write rate value for said data objects;
mapping each data object to a memory type to form a first memory map;
determining a memory read traffic value using said read rate value and said first memory map, and a write traffic value using said write rate value and said first memory map;
determining a read cost value and a write cost value for said memory types;
determining an assignment read cost value by multiplying said memory read traffic value with said read cost value, and an assignment write cost value by multiplying said memory write traffic value with said write cost value; and
generating said first assignment cost value by summing said assignment read cost value with said assignment write cost value.
4. The method of claim 3, wherein determining said read cost value and said write cost value comprises:
identifying at least one cost factor associated with each memory type; and
determining said read cost value and said write cost value using said at least one cost factor.
5. The method of claim 3, wherein receiving said read rate value and said write rate value for said data objects comprises:
receiving a read page count value and a write page count value; and
generating said read rate value and said write rate value using said read page count value and said write page count value, respectively.
6. The method of claim 3, wherein reassigning said virtual addresses comprises:
generating a second assignment cost value for said second set of physical addresses;
comparing said second assignment cost value with said first assignment cost value; and
reassigning said virtual addresses to said second set of physical addresses if said second assignment cost value is lower than said first assignment cost value.
7. The method of claim 6, wherein generating said second assignment cost value comprises:
remapping each data object to a memory type to form a second memory map;
determining said memory read traffic value using said read rate and said second memory map, and said write traffic value using said write rate and said second memory map;
determining said assignment read cost value by multiplying said memory read traffic value with said read cost value, and said assignment write cost value by multiplying said memory write traffic value with said write cost value; and
generating said second assignment cost value by summing said assignment read cost value with said assignment write cost value.
8. The method of claim 3, wherein mapping each data object to a memory type to form a first memory map comprises:
determining a set of mapping constraints for said mapping; and
mapping each data object to a memory type to form said first memory map in accordance with said mapping constraints.
9. The method of claim 1, wherein said reassigning comprises moving data objects for said agent from said first set of physical addresses to said second set of physical addresses.
10. An apparatus, comprising:
a task management module to retrieve a set of virtual addresses used by an agent;
a memory assignment module to couple to said task manager, said memory assignment module to assign said virtual addresses to a first set of physical addresses for a plurality of memory devices; and
a memory bandwidth module to couple to said memory assignment module, said memory bandwidth manager module to generate an assignment cost value for said assignment, and reassign said virtual addresses to a second set of physical addresses to lower said assignment cost value.
11. The apparatus of claim 10, further comprising a memory usage module to couple to said memory bandwidth module, said memory usage module to provide memory usage information to said memory bandwidth module to generate said assignment cost values.
12. The apparatus of claim 10, wherein said memory devices comprise internal memory and external memory.
13. The apparatus of claim 10, wherein said memory devices have different latency times, throughput, or power requirements.
14. The apparatus of claim 10, wherein said agent comprises one of a software program and hardware device.
15. A system, comprising:
an antenna;
a processing system to connect to said antenna, said processing system having a processor and a plurality of memory devices; and
a memory management module to couple to said processing system, said memory management module to manage assigning a plurality of agents to use a first set of memory devices from said plurality of memory devices based on an assignment cost value, and to reassign said plurality of agents to a second set of memory devices from said plurality of memory devices to lower said assignment cost value.
16. The system of claim 15, wherein said processing system further comprises a communication fabric to couple said processor to said memory devices.
17. The system of claim 15, wherein said memory management module comprises:
a task management module to retrieve a set of virtual addresses used by an agent;
a memory assignment module to couple to said task manager, said memory assignment module to assign said virtual addresses to a first set of physical addresses for said plurality of memory devices; and
a memory bandwidth module to couple to said memory assignment module, said memory bandwidth module to generate said assignment cost values.
18. The apparatus of claim 16, further comprising a memory usage module to couple to said memory bandwidth module, said memory usage module to provide memory usage information to said memory bandwidth module to generate said assignment cost values.
19. An article comprising:
a storage medium;
said storage medium including stored instructions that, when executed by a processor, are operable to retrieve a set of virtual addresses used by an agent, assign said virtual addresses to a first set of physical addresses, generate a first assignment cost value for said assignment, and reassign said virtual addresses to a second set of physical addresses using said first assignment cost value.
20. The article of claim 19, wherein the stored instructions, when executed by a processor, generate said first assignment cost value using stored instructions operable to identify a number of data objects associated with said agent, receive a read rate value and a write rate value for said data objects, map each data object to a memory type to form a first memory map, determine a memory read traffic value using said read rate value and said first memory map, and a write traffic value using said write rate value and said first memory map, determine a read cost value and a write cost value for said memory types, determine an assignment read cost value by multiplying said memory read traffic value with said read cost value, and an assignment write cost value by multiplying said memory write traffic value with said write cost value, and generate said first assignment cost value by summing said assignment read cost value with said assignment write cost value.
21. The article of claim 20, wherein the stored instructions, when executed by a processor, reassign said virtual addresses using stored instructions operable to generate a second assignment cost value for said second set of physical addresses, compare said second assignment cost value with said first assignment cost value, and reassign said virtual addresses to said second set of physical addresses if said second assignment cost value is lower than said first assignment cost value.
22. The article of claim 21, wherein the stored instructions, when executed by a processor, generate said second assignment cost value using stored instructions to remap each data object to a memory type to form a second memory map, determine said memory read traffic value using said read rate and said second memory map, and said write traffic value using said write rate and said second memory map, determine said assignment read cost value by multiplying said memory read traffic value with said read cost value, and said assignment write cost value by multiplying said memory write traffic value with said write cost value, and generate said second assignment cost value by summing said assignment read cost value with said assignment write cost value.